Result: Accepted
Time: 11ms
Memory: 1092kB
#include<stdio.h>
#include<stdlib.h>
struct student{
char name[20];
int lilun;
int shijian;
int sum;
};
int comp(const void *p,const void *q)
{
return ((struct student *)q)->sum-((struct student *)p)->sum;
}
int main()
{
int T;
scanf("%d",&T);
while(T--)
{
int N;
struct student st[110];
scanf("%d",&N);
for(int i=0;i<N;i++)
{
scanf("%s%d%d",st[i].name,&st[i].lilun,&st[i].shijian);
st[i].sum=st[i].lilun+st[i].shijian;
}
qsort(st,N,sizeof(struct student),comp);
for(int i=0;i<N;i++)
{
printf("%s\n",st[i].name);
}
}
return 0;
}