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

题目大意：

给出一些数字片段的集合，你的任务是把它们整合为最小的数字。比如给出一个集合{ 32, 321, 3214, 0229, 87 }，可以将它们打乱顺序整合为32-321-3214-0229-87或0229-32-87-321-3214，最小的数为0229-321-3214-32-87。

解题思路：

利用sort函数，amazing！参考博客https://blog.csdn.net/s_999999/article/details/96496259

代码如下：

#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
bool compare(string a,string b){
	return a + b < b + a;
}
int main(){
	vector<string> numbers;
	int N;
	scanf("%d",&N);
	for(int i = 1 ; i <= N ; i ++){
		string s;
		cin>>s;
		numbers.push_back(s);
	}
	sort(numbers.begin(),numbers.end(),compare);
	string ans;
	for(int i = 0 ; i < numbers.size() ; i ++)
		ans += numbers[i];
	while(ans.length() != 0 && ans[0] == '0'){//可能不止一个0 
		ans.erase(ans.begin());
	}
	if(ans.length() == 0)
		printf("0");
	else
		cout<<ans; 
	return 0;
}