题解来啦

#include<bits/stdc++.h>
using namespace std;
struct asd{
char name[25];
int jng,ing,tng,sum=0;
int id;
}a[100000];
bool cmp(asd x,asd y){
if(x.sum!=y.sum)return x.sum>y.sum;
if(x.jng!=y.jng)return x.jng>y.jng;
if(x.ing!=y.ing)return x.ing>y.ing;
return x.id<y.id;
}
int n;
int main(){
cin>>n;
for(int i=1;i<=n;i++){
cin>>a[i].name>>a[i].jng>>a[i].ing>>a[i].tng;
a[i].id=i;
a[i].sum=a[i].jng+a[i].ing+a[i].tng;
}
sort(a+1,a+n+1,cmp);
for(int i=1;i<=n;i++)printf("%s %d\n",a[i].name, a[i].sum);
return 0;
}