程序设计基础49 PAT A1038

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

一，注意点

1，这里的贪心策略不是字符串的字典序比较，而是两个字符串合起来的字典序比较。

2，要考虑进去输入的字符串全为0的情况。

二，标准代码

#include<iostream>
#include<cstdio>
#include<string>
#include<algorithm>
using namespace std;
const int max_n = 10010;
string str[max_n];
bool cmp(string a, string b) {
	return a + b < b + a;
}
int main() {
	int n = 0;
	scanf("%d", &n);
	for (int i = 0; i < n; i++) {
		cin >> str[i];
	}
	sort(str, str + n, cmp);
	string ans;
	for (int i = 0; i < n; i++) {
		ans += str[i];
	}
	while(ans.size()!=0&&ans[0]=='0'){
		ans.erase(ans.begin());
	}
	if (ans.size() == 0)cout << 0;
	else cout << ans;
}