Result: Accepted
Time: 10ms
Memory: 1092kB
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <math.h>
struct lj {
char name[66];
int lilun;
int shijian;
int zongfen;
};
int comp (const void *p,const void *q)
{
return ((struct lj *)q)->zongfen - ((struct lj *)p)->zongfen;
}
int main ()
{
struct lj list[666];
int t;
int n,i;
scanf("%d",&t);
while(t--)
{
scanf("%d",&n);
for(i=0;i<=n-1;i++)
{
scanf("%s%d%d",&list[i].name,&list[i].lilun,&list[i].shijian);
list[i].zongfen=list[i].lilun+list[i].shijian;
}
qsort(list,n,sizeof(struct lj),comp);
for(i=0;i<=n-1;i++)
{
printf("%s\n",list[i].name);
}
}
}