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

#include<stdio.h>
#include<string.h>
struct pm{
	char a[20];
	int ll;
	int sj;
};
int bu(int l[],int n){
    int p,i,t;
	for(p=1;p<n;++p){
		for(i=0;i<n-p;++i){
			if(l[i]>l[i+1]){
				t=l[i];
				l[i]=l[i+1];
				l[i+1]=t;}}}
}
int main(){	
	int a[100],T,n,i,j,k;
	struct pm b[100];
	scanf("%d",&T);
	while(T--){
		scanf("%d",&n);
		k=n;
		for(i=0;i<n;++i){
			scanf("%s%d%d",&b[i].a,&b[i].ll,&b[i].sj);
			a[i]=b[i].ll+b[i].sj;}
		bu(a,n);
		while(n){
			for(j=0;j<k;j++){
			    if(b[j].ll+b[j].sj==a[n-1])
			        printf("%s\n",b[j].a);}
			n--;
		}
	}
    return 0;
}