Result: Accepted
Time: 16ms
Memory: 1088kB
#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,i;
scanf("%d",&T);
while(T--){
struct student a[101];
scanf("%d",&n);
for(i=0;i<n;++i){
scanf("%s%d%d",a[i].name,&a[i].a,&a[i].b);
a[i].total=a[i].a+a[i].b;
}
qsort(a,n,sizeof(struct student),comp);
for(i=0;i<n;++i){
printf("%s\n",a[i].name);
}
}
return 0;
}