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