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