题解 | #找最小数#

#include <iostream>
#include <cstdio>
#include <algorithm>

using namespace std;

const int MAX_NUM = 1000;

struct Data {
    int x;
    int y;
};

/**
 * 按x升序排序，若x相等则按y升序排序
 * @param a 
 * @param b 
 * @return 
 */
bool compare(Data a, Data b) {
    if (a.x == b.x) {
        return a.y < b.y;
    } else {
        return a.x < b.x;
    }
}

/**
 * 找最小数--北京邮电大学
 * @return
 */
int main() {
    int n;
    Data *data;
    while (cin >> n) {
        data = new Data[n];
        for (int i = 0; i < n; ++i) {
            cin >> data[i].x >> data[i].y;
        }
        //升序排序
        sort(data, data + n, compare);
        //输出data[0]即可
        cout << data[0].x << " " << data[0].y << endl;
    }

    return 0;
}