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

#include<stdio.h>
#include<stdlib.h>
#include<string.h>
#include<math.h>
struct nick{
	int num1,num2;
	char name[21];
};
int comp(const void *p,const void *q){
	return (*(int*)q-*(int*)p);
}
int main(){
	struct nick wai[1000];
	int n,i,t,j,a[1000];
	scanf("%d",&t);
	while(t--){
    scanf("%d",&n);
	for(i=0;i<n;i++){
		scanf("%s%d%d",wai[i].name,&wai[i].num1,&wai[i].num2);
	}
	for(i=0;i<n;i++){
	a[i]=wai[i].num1+wai[i].num2;
	}
	qsort(a,n,sizeof(int),comp);
	for(i=0;i<n;i++)
		for(j=0;j<n;j++){
		if(a[i]==wai[j].num1+wai[j].num2)
			printf("%s\n",wai[j].name);
		}
	}
	return 0;
}