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