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