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