PAT A1038 Recover the Smallest Number (30 分)

PAT A1038 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

以下是AC的代码：

#include<cstdio>
#include<string>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;
const int maxn = 10010;
string str[maxn];
bool cmps(string a,string b){
	return a+b<b+a;
}
int main(void){
	int n;
	scanf("%d",&n);
	for(int i=0;i<n;i++){
		cin>>str[i];
	}
	sort(str,str+n,cmps);
	for(int i=0;i<n;i++) str[n]+=str[i];
	for(int i=0;i<5*n;i++){
		if(str[n][0] == '0') str[n].erase(str[n].begin());
	}
	if(str[n].size()==0) printf("0");
	cout<<str[n]<<endl;
	return 0;
}

思路：
这里请一定要用string 来做，比用 char的二维数组会简单很多。（string运算符，黏接等很方便）