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