#include<cstdio>
#include<iostream>
#include<algorithm>
#include<vector>
#include<queue>
#include<string>
#include<cstring>
#include<cmath>
#include<map>
#define ll long long
using namespace std;
string a[10005];
string ans;
const bool cmp(const string &x,const string &y)
{
return x+y<y+x;
}
int main()
{
int n,i,j;
while(scanf("%d",&n)!=EOF)
{
ans = "";
for(i = 0;i<n;i++)cin>>a[i];
sort(a,a+n,cmp);
for(i = 0;i<n;i++)ans+=a[i];
int bg = 0;
while(ans[bg] == '0'&&bg<ans.length()-1)bg++;
ans = ans.substr(bg,ans.length()-bg);
cout<<ans<<endl;
}
return 0;
}
pat1038 Recover the Smallest Number
最新推荐文章于 2019-08-10 16:16:11 发布