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