1038 Recover the Smallest Number （PAT甲级）

我起初的代码：

#include <cstdio>
#include <vector>
#include <string>
#include <algorithm>

int N;
char segment[9];
std::vector<std::string> vec;
bool flag = false;
bool ff = false;

bool cmp(const std::string &a, const std::string &b){
    return a + b <= b + a;
}

int main(){
    scanf("%d", &N);
    for(int i = 0; i < N; ++i){
        scanf("%s", segment);
        vec.push_back(segment);
    }
    sort(vec.begin(), vec.end(), cmp);
    for(int i = 0; i < N; ++i){
        for(int j = 0; j < vec[i].size(); ++j){
            if(!flag && vec[i][j] != '0'){
                flag = true;
                ff = true;
                printf("%c", vec[i][j]);
            } else if(flag){
                printf("%c", vec[i][j]);
                ff = true;
            }
        }
    }
    if(!ff){
        printf("0");
    }
    return 0;
}

后来看了柳婼的解法，改进了一下：

#include <cstdio>
#include <vector>
#include <string>
#include <algorithm>

int N;
char segment[9];
std::vector<std::string> vec;
std::string ans;

bool cmp(const std::string &a, const std::string &b){
    return a + b <= b + a;
}

int main(){
    scanf("%d", &N);
    for(int i = 0; i < N; ++i){
        scanf("%s", segment);
        vec.push_back(segment);
    }
    sort(vec.begin(), vec.end(), cmp);
    for(int i = 0; i < N; ++i){
        ans += vec[i];
    }
    while(ans.size() >= 2 && ans[0] == '0'){
        ans.erase(ans.begin());
    }
    printf("%s", ans.c_str());
    return 0;
}

题目如下：

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 (≤104) followed by Nnumber 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