题解sort排序

#include<bits/stdc++.h>
using namespace std;
struct s{
    string name;
    int w,m;
}a[100010];
bool cmp(s x,s y){
    if(x.w==y.w) return x.m>y.m;
    return x.w>y.w;
}
int main(){
    int n;
    cin>>n;
    for(int i=1;i<=n;i++){
        cin>>a[i].name>>a[i].w>>a[i].m;
    }
    sort(a+1,a+n+1,cmp);
    cout<<a[1].name<<" "<<a[1].w<<" "<<a[1].m;
    return 0;
}