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