题解 | #找最小数#

#include<iostream>
#include<queue>
using namespace std;
struct number{
    int x;
    int y;
    number(int a,int b) : x(a),y(b){};
};
struct cmp{
    bool operator() (number a,number b){
        if(a.x == b.x)    return a.y > b.y;
        return a.x > b.x;
    }
};
int main(){
    int n;
    cin >> n;
    priority_queue<number,vector<number>,cmp> que;
    while(n--){
        int m,q;
        cin >>m >>q;
        que.push(number(m,q));
    }
    cout << que.top().x << ' ' << que.top().y << endl;
    return 0;
}