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