Cod sursă (job #810218)

#include<bits/stdc++.h>
using namespace std;
ifstream fin("domino.in"); ofstream fout("domino.out");
vector<pair<int, int>> v;
bool compar(const pair<int, int>& a, const pair<int, int>& b)
	{return a.first>b.first || (a.first==b.first && a.second>b.second);}
int main()
	{int k, k1, k2, a, b, i;
	 fin>>k>>k1>>k2;
	 while(fin>>a>>b) v.push_back({a, b});
	 sort(v.begin(), v.end(), compar);
	 v.erase(v.end()-k2, v.end());
//	 fout<<v.size()<<'\n';
	 	for(i=0; i<v.size(); i++)
	 		{if(v[i].first<v[i].second) 
			  {swap(v[i].first, v[i].second); k1--;}
			  if(k1==0) break;
			}
	 if(k1>0) i=v.size()-1;
	 while(k1--) {swap(v[i].first, v[i].second); i--;}
	sort(v.begin(), v.end(), compar);
	for(int i=0; i<v.size(); i++)
	 	fout<<v[i].first<<v[i].second;
	return 0;
	}