Result: Accepted
Time: 12ms
Memory: 1092kB
#include<stdio.h>
#include<stdlib.h>
#define array_size 100
struct student {
char name[30];
int lilun,shijian;
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];
int t,n,i,k;
char d[30];
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].shijian);
studentarray[i].sum=studentarray[i].lilun+studentarray[i].shijian;
}
qsort(studentarray,n,sizeof(struct student),comp);
for(i=0;i<n;i++)
{
printf("%s\n",studentarray[i].name);
}
}
return 0;
}