题解 | #找最小数#

#define _CRT_SECURE_NO_WARNINGS 1
#include <bits/stdc++.h>
using namespace std;

struct shudui {
    int shu_1;
    int shu_2;
};
const int MAXN = 1000;
shudui arr[MAXN];
bool compare(shudui x, shudui y) {
    if (x.shu_1 == y.shu_1)return x.shu_2 < y.shu_2;
    else return x.shu_1 < y.shu_1;
}
int main() {
    int n = 0;
    while (scanf("%d", &n) != EOF) {
        for (int i = 0; i < n; i++) {
            scanf("%d %d", &arr[i].shu_1, &arr[i].shu_2);
        }
        sort(arr, arr + n, compare);
        cout << arr[0].shu_1 << " " << arr[0].shu_2 << endl;
    }
    return 0;
}