1339：ACM

#include<stdio.h>
#include<iostream>
#include<algorithm>
#include<string.h>
using namespace std;

typedef struct 
{
	char name[103];
	int num;
	int pulish;
}Team;

int cmp(Team a,Team b)
{
	if(a.num!=b.num)
		return a.num>b.num;
	else
	{
		if(a.pulish!=b.pulish)
			return a.pulish<b.pulish;
		else
			return strcmp(a.name,b.name)<0;
	}
}
int main()
{
	int n;
	Team t[100];
	
	while(scanf("%d",&n)!=EOF)
	{
		int i;
		for(i=0;i<n;++i)
		{
			scanf("%s%d%d",t[i].name,&t[i].num,&t[i].pulish);
		}
		sort(t,t+n,cmp);
		for(i=0;i<n;++i)
		{
			printf("%s\n",t[i].name);
		}
	}
	return 0;
}