Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include<iostream>
- #include<algorithm>
- #include<fstream>;
- using namespace std;
- ifstream fin("concurs.in");
- ofstream fout("concurs.out");
- int x[1005];
- int z[1005];
- int main()
- {
- int n, i, j, k, l, m=0, p=0, a=0, nr, nr2;
- fin>>n;
- j=0;
- for(i=1; i<=n; i+=2)
- {
- fin>>nr>>nr2>>k;
- x[++j]=k;
- if(x[j]==nr)
- {
- z[++p]=nr2;
- }
- else
- {
- z[++p]=nr;
- }
- }
- sort(x+1, x+n/2+1);
- sort(z+1, z+n/2+1);
- for(i=1; i<=j; i++)
- {
- fout<<x[i]<<' ';
- }
- fout<<'\n';
- for(i=1; i<=j/2; i++)
- {
- fout<<x[i]<<' '<<x[j/2+i]<<'\n';
- }
- for(i=1; i<=p/2; i++)
- {
- fout<<z[i]<<' '<<z[p/2+i]<<'\n';
- }
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement