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