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