80分 求助QwQ```c
#include<bits/stdc++.h>
using namespace std;
struct node{
string id;
int yw,sx,yy,sum,cnt;
}a[1005];
bool cmp(node x,node y){
if(x.sum==y.sum)
return x.id<y.id;
return x.sum>y.sum;
}
int main(){
int n;
cin>>n;
for(int i=1;i<=n;i++){
cin>>a[i].id>>a[i].yw>>a[i].sx>>a[i].yy;
a[i].sum=a[i].yw+a[i].sx+a[i].yy;
a[i].cnt=i;
}
sort(a+1,a+n+1,cmp);
cout<<a[1].id<<" "<<a[1].yw<<" "<<a[1].sx<<" "<<a[1].yy;
return 0;
}
