Result: Accepted
Time: 12ms
Memory: 1092kB
#include<math.h>
#include<stdio.h>
#include<string.h>
#include<stdlib.h>
struct student {
int fen1,fen2,pingjun;
char name[20];
};
int comp (const void *p,const void*q)
{
return ((struct student*)q)->pingjun-((struct student*)p)->pingjun;
}
void main()
{
int n,m,i,j,k,a1[1000];
char ch;
struct student man[100];
scanf("%d",&n);
while(n--)
{
scanf("%d",&m);
getchar();
for(i=0;i<m;i++)
{
scanf("%s%d%d",&man[i].name,&man[i].fen1,&man[i].fen2);
man[i].pingjun=man[i].fen1+man[i].fen2;
}
qsort(man,m,sizeof(struct student),comp);
for(i=0;i<m;i++)
printf("%s\n",man[i].name);
}
}