Result: Accepted
Time: 12ms
Memory: 1092kB
#include<stdio.h>
#include<stdlib.h>
#define Array_SIZE 120
struct student{
char name[40];
int lilun,shiyan;
int sum;
};
int comp(const void *p,const void *q)
{
return ((struct student *)q)->sum-((struct student *)p)->sum;
}
int main(void){
struct student studentarray[Array_SIZE];
struct student maxsum;
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].lilun,&studentarray[i].shiyan);
studentarray[i].sum=studentarray[i].lilun+studentarray[i].shiyan;
}
qsort(studentarray,n,sizeof(struct student),comp);
for(i=0;i<n;++i){
printf("%s\n",studentarray[i].name);
}
}
return 0;
}