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