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