题解

27行代码带你解决

#include<iostream>
#include<algorithm>
using namespace std;
struct paiming{
    string name;
    int question;
    int time;
}a[2000000];
bool cmp(paiming x , paiming y){
    if(x.question != y.question)return x.question > y.question;
    else if(x.time != y.time)return x.time < y.time;
    else return x.name > y.name;
}
int main(){
    int n;
    cin >> n;
    for(int i = 0;i < n;i++){
        cin >> a[i].name;
        cin >> a[i].question;
        cin >> a[i].time;
    }
    sort(a + 0,a + n,cmp);
    for(int i = 0;i < n;i++){
        cout << a[i].name << endl;
    }
    return 0;
}