PAT Recover the Smallest Number - 题目链接
题目描述
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.
输入描述
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.
输出描述
For each test case, print the smallest number in one line. Notice that the first digit must not be zero.
示例:
输入
5 32 321 3214 0229 87
输出
22932132143287
解题思路
这题与其说是贪心,不如说是c++中string的使用方法。这题比较简单,先按照排序规则找到按照字典序从小到大排序,之后进行字符串的相加。消除前导0后,根据字符串的大小输出字符串就可以了。
参考代码
#include <iostream>
#include <algorithm>
#include <string>
using namespace std;
const int maxn = 10010;
string str[maxn];
bool cmp(string a, string b) {
return a + b < b + a;
}
int main() {
int n;
string ans;
cin >> n;
for (int i = 0; i < n; ++i) {
cin >> str[i];
}
sort(str, str + n, cmp);
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;
}
return 0;
}