rt

题目：1011;

代码：

#include<bits/stdc++.h>
#define rg register int
using namespace std;
int n;
struct node
{
	int z,t;
}a[21];
inline bool cmp(node x,node y)
{
	if(x.t==y.t) return x.z>y.z;
	return x.t>y.t;
}
int main()
{
	scanf("%d",&n);
	char x;
	x=getchar();
	for(rg i=1;i<=n;i++)
	{
		a[i].z=0;
		a[i].t=0;
		x='s';
		while(x!=' '&&x!='\n')
		{
			x=getchar();
			if(x>='0'&&x<='9') 
			{
				a[i].z*=10;
				a[i].z+=x-'0';
				if(a[i].t==0)
				{
					a[i].t=x-'0';
				}
			}
			else break;
		}
	}
	sort(a+1,a+n+1,cmp);
	for(rg i=1;i<=n;i++) printf("%d",a[i].z);
	return 0;
}