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