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