PAT (Advanced Level) Practice 1038

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

 分析：在这里用字符串来存储数字比较好。找最小值的题目肯定要用贪心，关键是如何判断“最小”这个标准。字典序肯定不对。比较时可以发现中间几个开头相同的数字在排列的顺序不同得到的数的大小关系也不同，所以可以依据排列的顺序来进行排序，即字符串a与字符串b的组合ab与ba之间的大小关系来排序。

 代码：

#include<iostream>
#include<algorithm>
#include<vector>
#include<string>
using namespace std;
bool cmp(string a, string b) {
	return a + b < b + a;
}
int main() {
	int N;
	cin >> N;
	getchar();
	vector<string> v(N);
	for (int i = 0; i < N; i++) {
		cin >> v[i];
	}
	sort(v.begin(), v.end(), cmp);
	string ans = "";
	for (int i = 0; i < N; i++) {
		ans += v[i];
	}
	while (ans[0] == '0') {
		ans.erase(ans.begin());
	}
	if (ans.size() == 0) {
		cout << '0' << endl;
	} else {
		cout << ans << endl;
	}
	return 0;
}