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