大佬救命

#include <bits/stdc++.h>
using namespace std;
struct stu{
    string name;
    int yu,shu,yin;
    int zong;
};
stu a[1005];
bool cmp(stu x,stu y){
    if(x.zong != y.zong) return x.zong > y.zong;
}
int main(){
    int n;
    cin >> n;
    for(int i = 1; i <= n; i++){
        cin >> a[i].name;
        cin >> a[i].yu;
        cin >> a[i].shu;
        cin >> a[i].yin;
        a[i].zong = a[i].yu + a[i].shu + a[i].yin;
    }
    sort(a + 1,a + n + 1,cmp);
    cout << a[1].name << " " << a[1].yu << " " << a[1].shu << " " << a[1].yin;
    return 0;
}