A1038 Recover the Smallest Number (30 分)

#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <algorithm>
#include <cmath>
#include <cctype>
using namespace std;
typedef long long ll;

bool cmp(string s1, string s2){
    return s1 + s2 < s2 + s1;
}
int main(){	
	int N;
	string str[10010];
	scanf("%d", &N);
	for(int i = 0; i < N; i++){
		cin >> str[i];
	}
	sort(str, str+N, cmp);
	string ans = "";
	for(int i = 0; i < N; i++){
		ans += str[i];
	}
	int p = 0;
	while(ans[p] == '0' && p < ans.size())p++;
	if(p == ans.size()) putchar('0');
	for(int i = p; i < ans.size(); i++){
		putchar(ans[i]);
	}
	return 0;
}