题解 | #找最小数#

#include <iostream>
#include <algorithm>
using namespace std;
const int N = 1001;

struct P{
    int x;
    int y;
} a[N];

bool cmp(P p1, P p2){
    if(p1.x == p2.x) return p1.y < p2.y;
    else return p1.x < p2.x;
}

int main() {
    int n;
    while (cin >> n) {
        for(int i = 0; i < n; i ++){
            cin >> a[i].x >>a[i].y;
        }
        sort(a, a + n, cmp);
        cout << a[0].x << " " << a[0].y << endl;
    }
    return 0;
}
// 64 位输出请用 printf("%lld")