Result: Accepted
Time: 11ms
Memory: 1092kB
#include<stdio.h>
#include<stdlib.h>
struct stu{
char name[30];
int lilun;
int shijian;
int total;
};
int comp(const void * p,const void * q){
return ((struct stu *)q)->total-((struct stu *)p)->total;
}
int main(){
struct stu stuA[100];
int T,n,i,j;
scanf("%d",&T);
for(i=1;i<=T;++i){
scanf("%d",&n);
for(j=0;j<n;++j){
scanf("%s%d%d",stuA[j].name,&stuA[j].lilun,&stuA[j].shijian);
stuA[j].total=stuA[j].lilun+stuA[j].shijian;
}
qsort(stuA,n,sizeof(struct stu),comp);
for(j=0;j<n;++j){
printf("%s\n",stuA[j].name);
}
}
return 0;
}