题解 | #找最小数#

#include<cstdio>
#include<algorithm>
using namespace std;

struct Datalist{
    int x;
    int y;
};

bool comp(Datalist a,Datalist b){
    if(a.x != b.x)
        return a.x < b.x;
    else
        return a.y < b.y;

}


int main(){
    int n;
    Datalist arr[1010];

    while(scanf("%d",&n) != EOF){
        for(int i = 0; i < n; i++)
            scanf("%d%d",&arr[i].x,&arr[i].y);
        sort(arr,arr+n,comp);

        printf("%d %d\n",arr[0].x,arr[0].y);

    }


    return 0;
}