Cod sursă (job #816365)

#include <iostream>
#include <fstream>

using namespace std;

ifstream in("infasuratoare.in");
ofstream out("infasuratoare.out");

int x[100001],y[100001],n,cnt,mn1,mn2,p,cnt2;

int main()
{
    in>>n;
    cnt=1;
    while(cnt<=n){
        in>>x[cnt]>>y[cnt];
        cnt++;
    }
    cnt=1;
    while(cnt<=n){
        mn1=99999999;
        mn2=99999999;
        cnt2=1;
        while(cnt2<=n){
            if(y[cnt2]<=mn1){
                mn1=y[cnt2];
                mn2=x[cnt2];
                p=cnt2;
            }
            if(y[cnt2]==mn1){
                if(x[cnt2]<mn2){
                    mn2=x[cnt2];
                    p=cnt2;
                }
            }
            cnt2++;
        }
        out<<mn2<<" "<<mn1<<endl;
        x[p]=99999999;
        y[p]=99999999;
        cnt++;
    }
    return 0;
}