Result: Accepted
Time: 16ms
Memory: 1092kB
#include<stdio.h>
#include<stdlib.h>
struct student{
char name[40];
int lilun;
int shijian;
int score;
};
int comp(const void *p,const void *q){
return ((struct student *)q)->score-((struct student *)p)->score;
}
int main(){
struct student array[110];
int i,n;
int T;
scanf("%d",&T);
while(T--){
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%s%d%d",array[i].name,&array[i].lilun,&array[i].shijian);
array[i].score=array[i].lilun+array[i].shijian;
}
qsort(array,n,sizeof(struct student),comp);
for(i=0;i<n;i++){
printf("%s\n",array[i].name);
}
}
return 0;
}