1038 Recover the Smallest Number (30 分) 建议贪心， string的sort

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 (≤10e​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

Note

1. 将输入拼接成最小的数，
2. stl真香
3. 比较最小的技巧： 比较拼接的结果

Code

#include<iostream>
#include<algorithm>
#include<string>
using namespace std;
bool cmp1(string a, string b){
    return a + b < b + a;
}
string str[10010];
int main(){
    int num;
    cin >> num;
    for(int i = 0; i < num; i++){
        cin >> str[i];
    }
    sort(str, str + num, cmp1);
    string s;
    for(int i = 0; i < num; i++){
        s += str[i];
    }
    while(s.size() > 0 && s[0] == '0'){
        s.erase(s.begin());
    }
    if(s.size() == 0) cout << "0";
    else cout << s;
    return 0;
}