A1038. Recover the Smallest Number (30)

1038. Recover the Smallest Number (30)

时间限制

400 ms

内存限制

65536 kB

代码长度限制

16000 B

判题程序

Standard

作者

CHEN, Yue

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

#include<iostream>
#include<algorithm>
//sort can't be used for char str[],use a struct and put char str[] in it
using namespace std;
bool cmp(string a,string b){
	return a+b < b+a;
}
int main(){
	int n;
	cin >> n;
	string str[n],sum;
	for(int i = 0;i < n;i++)
		cin >> str[i];
	sort(str,str+n,cmp);
	for(int i = 0;i < n;i++)
		sum += str[i];
	while(sum.size() && sum[0]=='0') sum.erase(sum.begin());		
	if(sum.size())
		cout << sum << endl;
	else
		cout << 0 << endl;		//考虑全为0时
	return 0;
}