#Leetcode#179.LargestNumber

#include
using namespace std;
int n;
int num[1010];
struct Node {
char s[40];
}node[1010];
int bigger(const Node& a, const Node& b) {
int la = strlen(a.s), lb = strlen(b.s);
int minn = min(la, lb);
for(int i = 0; i if(a.s[i] == b.s[i]) continue;
else if(a.s[i] > b.s[i]) return 1;
else return -1;
}
if(minn == la && b.s[minn] > a.s[0]) return -1;
else if(minn == la && b.s[minn] else if(minn = lb && a.s[minn] > b.s[0]) return 1;
return -1;
}
bool cmp(const Node& a, const Node& b) {
return bigger(a, b) > 0;
}
int main() {
scanf("%d", &n);
int cnt;
for(int i = 0; i cnt = 0;
scanf("%d", &num[i]);
while(num[i]) {
node[i].s[cnt ++] = (num[i] % 10 + ‘0‘);
num[i] /= 10;
}
for(int j = 0; j swap(node[i].s[j], node[i].s[cnt - j - 1]);
}
sort(node, node + n, cmp);
for(int i = 0; i printf("%s", node[i].s);
return 0;
}