Result: Accepted
Time: 17ms
Memory: 1760kB
#include<stdio.h>
#include<stdlib.h>
struct student{
char name[31];
int score[2];
int total;
};
int comp(const void*p,const void *q)
{
return ((struct student *)q)->total-((struct student *)p)->total;
}
int main()
{
struct student studentArray[100];
int T,n,i,m,A[200000],j,flag;
scanf("%d",&T);
while(T--)
{
scanf("%d",&n);
for(i=0;i<n;++i)
{
scanf("%s %d %d",studentArray[i].name,&studentArray[i].score[0],&studentArray[i].score[1]);
studentArray[i].total=studentArray[i].score[0]+studentArray[i].score[1];
}
qsort(studentArray,n,sizeof(struct student),comp);
for(i=0;i<n;++i)
{
printf("%s\n",studentArray[i].name);
}
}
}