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