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