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