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 (<=10000) 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. Do not output leading zeros.

Sample Input:
5 32 321 3214 0229 87
Sample Output:

22932132143287

IDEA

1. 比较两个字符串，a若是b的前缀，字符串a连上b的与字符串b连上a比较大小；b若是a的前缀同理

2.否则，直接比较两个字符串的大小，从小到大排序

3.注意若果结果为0的情况，需要输出0；其余首位是0的不输出

CODE

#include<iostream>
#include<vector>
#include<cstring>
#include<algorithm>
using namespace std;
int cmp(string a,string b){
	if(a.size()<b.size()&&a==b.substr(0,a.size())){//a是b的前缀 
		return a+b<b+a;
	}else if(a.size()>b.size()&&b==a.substr(0,b.size())){//b是a的前缀 
		return a+b<b+a;
	}else{
		return a<b;
	}
}
int main(){
	int n;
	cin>>n;
	vector<string> vec(n);
	for(int i=0;i<n;i++){
		cin>>vec[i];
	}
	sort(vec.begin(),vec.end(),cmp);
	string result="";
	for(int i=0;i<n;i++){
		result+=vec[i];
	}
	int	k;
	for(k=0;k<result.size();k++){
		if(result[k]!='0'){
			break;
		}
	}
	if(k==result.size()){
		cout<<"0";
	}else{
		cout<<result.substr(k);
	}
	return 0;
}