1038 Recover the Smallest Number (30 分)

Given a collection of number segments, you are supposed to recover the smallest number from them. For example, given { 32, 321, 3214, 0229, 87 }, we can recover many numbers such like 32-321-3214-0229-87 or 0229-32-87-321-3214 with respect to different orders of combinations of these segments, and the smallest number is 0229-321-3214-32-87.

Input Specification:

Each input file contains one test case. Each case gives a positive integer N (≤10​4​​) followed by N number segments. Each segment contains a non-negative integer of no more than 8 digits. All the numbers in a line are separated by a space.

Output Specification:

For each test case, print the smallest number in one line. Notice that the first digit must not be zero.

Sample Input:

5 32 321 3214 0229 87

Sample Output:

22932132143287

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

using namespace std;

bool cmp(string a, string b)  //我自己想不到用这样方法做 是智商问题还是学的浅 、不思考的问题呢
{
	return a + b < b + a;
}

int main()
{
	//freopen("in.txt", "r", stdin);
	int n;
	
	string ans;
	cin >> n;
	vector<string > s(n);  //直接开vector<strign> s(10001) 不会过
	for (int i = 0; i < n; i++)
	{
		cin >> s[i];
	}
	sort(s.begin(), s.end(), cmp);
	int i = 0;
	while (i<n)
	{
		ans += s[i++];
	}
	while (ans.length()!=0&&ans[0]=='0')//开头的0可能不止一个
	{
		ans.erase(ans.begin());
	}
	if (ans.length()==0)
	{
		cout << 0;
	}
	else
	{
		cout << ans << endl;
	}
	//fclose(stdin);
	
	return 0;
}