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