有点坑，当时还琢磨了很久

#include<iostream>
#include<algorithm>
#define MAXN (200000+5)
#define fastcio ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
using namespace std;
int n;
struct node{
    string s;
    int a,b;
}p[MAXN];
bool cmp(node x,node y){
    if(x.a!=y.a) return x.a>y.a;
    if(x.b!=y.b) return x.b<y.b;
    return x.s>y.s;
}
int main(){
    fastcio
    int n;
    cin>>n;
    for(int i=0;i<n;i++){
        cin>>p[i].s>>p[i].a>>p[i].b;
    }
    sort(p,p+n,cmp);
    for(int i=0;i<n-1;i++){
        cout<<p[i].s<<"\n";
    }
    cout<<p[n-1].s;
}