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