题解 | 找最小数

#include<iostream>
#include<algorithm>
using namespace std;
const int maxn=1000;
struct Pair{
    int x;
    int y;
};
Pair arr[maxn];
bool Compare(Pair x,Pair y){
    if(x.x==y.x)
        return x.y<y.y;
    else
        return x.x<y.x;
}
int main(){
    int n;
    while(cin>>n){
        for(int i=0;i<n;i++){
            cin>>arr[i].x>>arr[i].y;
        }
        sort(arr,arr+n,Compare);
        cout<<arr[0].x<<" "<<arr[0].y<<endl;
    }
}