uva10905

link：http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=1846

题目大意：给出n个数，让他们排列组成一个新的整数，求组成的最大整数。

思路：对每个数排序，重写cmp函数。

#include <iostream>
#include <cmath>
#include <stdio.h>
#include <algorithm>
#include <ctime>
#include <vector>
#include <cstring>
#include <map>
#include <string>;
using namespace std;
#define LL long long
#define ULL unsigned long long
//#define REP(i,n) for(int i=0;i<n;++i)
#define REP(i,a,b) for(int i=a;i<=b;++i)
#define INFLL (1LL)<<62
#define mset(a) memset(a,0,sizeof a)
#define FR(a) freopen(a,"r",stdin)
#define FW(a) freopen(a,"w",stdout)
#define PI 3.141592654
const LL MOD = 1000000007;
const int maxn = (int)5e4+10;

bool cmp(string a,string b)
{
	return (a+b)>(b+a);
}
string str[55];
int main()
{
	int n;
	while (cin>>n,n)
	{
		REP(i,0,n-1){
			cin>>str[i];
		}
		sort(str,str+n,cmp);
		REP(i,0,n-1)
			cout<<str[i];
		puts("");
	}
}