题解 | 找最小数

#define _CRT_SECURE_NO_WARNINGS
#include <stdio.h>
#include <algorithm>
#include <vector>
using namespace std;
struct xy1{
    int x;
    int y;
};
bool compare(xy1 lhs, xy1 rhs) {
    if (lhs.x == rhs.x) {
        return lhs.y <= rhs.y;
    }
    else {
        return lhs.x <= rhs.x;
    }
}
int main() {
    int n, x, y;
    while (scanf("%d", &n) != EOF) {
        vector<xy1> p(n);
        for (int i = 0; i < n; ++i) {
            scanf("%d%d", &x, &y);
            p[i].x=x;
            p[i].y = y;
        }
        sort(p.begin(), p.end(), compare);
        printf("%d %d", p[0].x, p[0].y);
        p.clear();
    }
    return 0;
}