Start: Jan, 04, 2017 19:40:00
2016年秋季学期程序设计基础期末考试
End: Jan, 04, 2017 21:40:00
Time elapsed:
Time remaining:

Problem_ID: D
Result: Accepted
Time: 10ms
Memory: 1092kB
Author: 2016210402099
In contest: 1084

#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <math.h>
struct lj {
	char name[66];
	int lilun;
	int shijian;
	int zongfen;
};
int comp (const void *p,const void *q)
{
	return ((struct lj *)q)->zongfen - ((struct lj *)p)->zongfen;
}

int main ()
{
	struct lj list[666];
	int t;
	int n,i;
	scanf("%d",&t);
	while(t--)
	{	
		scanf("%d",&n);
		for(i=0;i<=n-1;i++)
		{
			scanf("%s%d%d",&list[i].name,&list[i].lilun,&list[i].shijian);
			list[i].zongfen=list[i].lilun+list[i].shijian;
		}
		qsort(list,n,sizeof(struct lj),comp);
		for(i=0;i<=n-1;i++)
		{
			printf("%s\n",list[i].name);
		}
	}
}