Result: Accepted
Time: 11ms
Memory: 1092kB
#include<stdio.h>
#include<math.h>
#include<stdlib.h>
#include<string.h>
struct xiaoxiangmi{
char name[40];
int score[2];
double sum;
};
int comp(const void*p,const void*q)
{
return ((struct xiaoxiangmi*)q)->sum-((struct xiaoxiangmi*)p)->sum;
}
int main(void)
{
struct xiaoxiangmi a[200];
int t,n,i;
scanf("%d",&t);
while(t--)
{
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s %d %d",a[i].name,&a[i].score[0],&a[i].score[1]);
a[i].sum=a[i].score[0]+a[i].score[1];
}
qsort(a,n,sizeof(struct xiaoxiangmi),comp);
for(i=0;i<n;i++)
{
printf("%s\n",a[i].name);
}
}
return 0;
}