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