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: 12ms
Memory: 1092kB
Author: 2016210402031
In contest: 1084

#include<stdio.h>
#include<string.h>
#include<stdlib.h>

struct name{
	char a[100];
	int b;
	int c;
	int d;
};

int comp(const void *p,const void *q){
	return ((struct name * )q)->d - ((struct name * )p)->d;
}
int comp2(const void *p,const void *q){
	return ((struct name * )p)->b - ((struct name * )q)->b;
}

int main(void){
	int t,i,j,p,q,x,y,k,l;
	int n,m;
	int a,b;
	char c;
	struct name g[200];
	scanf("%d",&t);
	while(t--){
		scanf("%d",&n);
		for(i=0;i<n;i++){
			scanf("%s %d %d",g[i].a,&g[i].b,&g[i].c);
			g[i].d=g[i].b+g[i].c;
		}
		qsort(g,n,sizeof(struct name),comp)	;
		for(i=0;i<n;i++){
			printf("%s\n",g[i].a);
		}

	}

	return 0;
}