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