洛谷P1012 [NOIP1998 提高组] 拼数进阶解法

#include<iostream>
#include<algorithm>
#include<string>

using namespace std;
int n;
string a[20];

bool compare(const string& a, const string& b)
{
	int s_a = a.length(), s_b = b.length();
	for (int i = 0; i < min(s_a, s_b); i++)
		if (a[i] > b[i])
			return true;
		else if (a[i] < b[i])
			return false;
	if (a + b < b + a)
		return false;
	else
		return true;
}

int main()
{
	cin >> n;
	for (int i = 0; i < n; i++)
		cin >> a[i];
	sort(a, a + n, compare);
	for (int i = 0; i < n; i++)
		cout << a[i];
	return 0;
}