PAT甲级 1038 Recover the Smallest Number (30 分)

最新推荐文章于 2022-08-19 18:06:09 发布

原创最新推荐文章于 2022-08-19 18:06:09 发布 · 112 阅读

0 ·

CC 4.0 BY-SA版权

PAT甲级专栏收录该内容

79 篇文章

订阅专栏

这是一个关于数字组合的问题，给定一系列数字段，需要找到能够组成最小数值的组合方式。例如，给定数字段{32, 321, 3214, 0229, 87}

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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⁴) 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

#include <iostream>
#include <algorithm>

using namespace std;
string a[10005];

bool cmp(string s1, string s2) {
    return s1 + s2 < s2 + s1;
}

int main() {
    int N;
    cin >> N;
    for (int i = 0; i < N; ++i) {
        cin >> a[i];
    }
    sort(a, a + N, cmp);
    string s;
    for (int i = 0; i < N; ++i)
        s += a[i];
    while (s.size() != 0 && s[0] == '0')
        s.erase(s.begin());
    if (!s.size())
        cout << 0;
    else
        cout << s;
    return 0;
}