Result: Accepted
Time: 16ms
Memory: 1092kB
#include<stdio.h>
#include<stdlib.h>
#define a 101
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[a];
int i,n,t;
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);
}
}
return 0;
}