Cod sursa(job #2179771)

Utilizator ioanavasilescuIoana Vasilescu ioanavasilescu Data 20 martie 2018 13:59:47
Problema Cele mai apropiate puncte din plan Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.63 kb
#include <iostream>
#include <fstream>
#include <algorithm>

#define lim 100010

using namespace std;

ifstream fin("cmap.in");
ofstream fout("cmap.out");

struct punct
{
    int x,y;
}Y[lim];

bool sortCondition(punct i,punct j)
{
    if(i.x<j.x) return 1;
    if(i.x==j.x && i.y<j.y) return 1;
    return 0;
}

void check(int n)
{
    for(int i=1;i<=n;i++)
        cout<<Y[i].x<<" "<<Y[i].y<<"\n";
    cout<<"\n";
}

int main()
{
    int n;
    fin>>n;
    for(int i=1;i<=n;i++)
    {
        fin>>Y[i].x>>Y[i].y;
    }
    check(n);
    sort(Y,Y+n,sortCondition);
    check(n);
    return 0;
}