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