PAT甲级练习1038. 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

一开始想着比较字符的方法来完成比较函数，但是做完后第二个测试点通不过，应该是零的问题，没解决，发现比较函数可以用下面代码里的方法解决，方便不少，最后就是清零的问题。。。参考了http://www.liuchuo.net/archives/2303 

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <vector>
#include <map>
#include <set>
#include <string>
#include <string.h>

using namespace std;

const int MAX=1e5+10;
string x[MAX];

bool cmp(string a, string b){
	return a + b < b + a; 
}

int main(){

	int n;
	string s;
	scanf("%d", &n);
	for(int i=0; i<n; i++) cin>>x[i];
	
	sort(x, x+n, cmp);
	for(int i=0; i<n; i++) s += x[i];

	while(s.length()!=0 && s[0]=='0') s.erase(s.begin());

	if(s.length()==0)cout<<0;
	else cout<<s;

	cin>>n;
	return 0;
}