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