1038 Recover the Smallest Number (30 分)

版权声明:转载留名即可 ^_^ https://blog.csdn.net/qq_33375598/article/details/88363044

 

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

参考代码:

#include<cstdio>
#include<iostream>
#include<string>
#include<algorithm>

using namespace std;

const int maxn = 10010;
string str[maxn];

bool cmp(string a, string b){
    return a + b < b + a;//如果a+b小于b+a,就把a排在前面
}

int main(){
    int n;
    scanf("%d", &n);
    for (int i = 0; i < n; ++i) {
        cin >> str[i];
    }
    sort(str, str + n, cmp);//排序
    string ans;                 //结果字符串
    for (int j = 0; j < n; ++j) {//拼接
        ans += str[j];
    }
    while(ans.size() != 0 && ans[0] == '0'){//去前导零
        ans.erase(ans.begin());
    }
    if(ans.size() == 0) printf("0\n");
    else cout << ans<<endl;
    return 0;

}

 

没有更多推荐了,返回首页