Result: Accepted
Time: 15ms
Memory: 1092kB
#include<stdio.h>
#include<stdlib.h>
#include<math.h>
#include<string.h>
struct sd
{
char name[35];
int lilun,shijian,he;
};
int comp(const void *p,const void * q)
{
return ((struct sd *)q)->he-((struct sd *)p)->he;
}
int main()
{
int i,t,n,c,i1,die;
struct sd a[101];
scanf("%d",&t);
while(t--)
{
scanf("%d",&n);
getchar();
for(i=0;i<n;i++)
{
scanf("%s%d%d",a[i].name,&a[i].lilun,&a[i].shijian);
a[i].he=a[i].lilun+a[i].shijian;
}
qsort(a,n,sizeof(struct sd),comp);
for(i=0;i<n;i++)
{
printf("%s\n",a[i].name);
}
}
return 0;
}