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