Result: Accepted
Time: 14ms
Memory: 1092kB
#include<stdio.h>
#include<stdlib.h>
struct student{
char name[31];
int a;
int b;
int total;
};
int comp(const void *p,const void *q){
return ((struct student *)q)->total-((struct student *)p)->total;
}
int main(){
int t,n;
scanf("%d",&t);
while(t--){
struct student c[100];
scanf("%d",&n);
for(int i=0;i<n;++i){
scanf("%s %d %d",c[i].name,&c[i].a,&c[i].b);
c[i].total=c[i].a+c[i].b;
}
qsort(c,n,sizeof(struct student),comp);
for(int i=0;i<n;++i){
printf("%s\n",c[i].name);
}
}
return 0;
}