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