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