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