0
已采纳
太水了
张汀熹在2021-10-28 13:12:33追加了内容
struct stu{
string a;
int b,c,d,e,f;
int sum(){
return c+d+e+f;
}
}a[105];
bool cmp(stu x,stu y){
if(x.sum()!=y.sum()){
return x.sum()>y.sum();
}
if(x.f!=y.f){
return x.f>y.f;
}
return x.a<y.a;
}
int main(){
int n;
cin>>n;
for(int i=1;i<=n;i++){
cin>>a[i].a>>a[i].b>>a[i].c>>a[i].d>>a[i].e>>a[i].f;
}
sort(a+1,a+n+1,cmp);
for(int i=1;i<=n;i++){
cout<<i<<" "<<a[i].a<<" "<<a[i].sum()<<endl;
}
核心
0
