题解

#include<bits/stdc++.h>
using namespace std;
struct node{
    string name;
    int id,s;
}a[200005];
bool cmp(node x,node y){
    if(x.id != y.id) return x.id > y.id;
    else if(x.s != y.s) return x.s < y.s;
    else return x.name > y.name;
}
int main(){
    int n; cin >> n;
    for(int i = 1;i <= n;i++) cin >> a[i].name >> a[i].id >> a[i].s;
    sort(a + 1,a + n + 1,cmp);
    for(int i = 1;i <= n - 1;i++) cout << a[i].name << endl;
    //what's?
    cout << a[n].name;
    return 0;
}