题解

#include <bits/stdc++.h>
using namespace std;
struct node{
string id;
int a,b,c,d;
}a[110];
bool cmp(node x,node y){
return x.id<y.id;
}
int main(){
int n;
cin>>n;
for(int i=0;i<n;i++) cin>>a[i].id>>a[i].a>>a[i].b>>a[i].c,a[i].d=a[i].a+a[i].b+a[i].c;
sort(a,a+n,cmp);
for(int i=0;i<n;i++) cout<<a[i].id<<" "<<a[i].a<<" "<<a[i].b<<" "<<a[i].c<<" "<<a[i].d<<endl;
return 0;
}