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