题解 | 成绩排序

#include <iostream>
#include<algorithm>
using namespace std;

struct Info{
    int id;
    int score;
};

bool comp(Info info1, Info info2){
    if(info1.score == info2.score){
        return info1.id < info2.id;
    }
    return info1.score < info2.score;
}

int main() {
    int n;
    cin >> n;

    Info info[n];

    for(int i = 0; i < n; ++i){
        int p, q;
        cin >> p >> q;
        info[i].id = p;
        info[i].score = q;
    }

    sort(info, info+n, comp);

    for(int i = 0; i < n; ++i){
        cout << info[i].id << " " << info[i].score << endl;
    }




}