PAT (Advanced Level) Practice 1038 Recover the Smallest Number (30 分)

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(\le 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

思路

• 自定义排序, 使得字符串最小
• 去除前导零
• 如果最后字符串为空 记得输出0

AC code

#include<iostream>
#include<vector>
#include<string>
#include<algorithm>
using namespace std;
bool cmp(const string& s1,const string& s2){
    return s1+s2<s2+s1;
}
int main(){
    int n;
    cin >> n;
    vector<string> v(n);
    getchar();
    for(int i=0;i<n;i++){
        cin >> v[i];
    }
    sort(v.begin(),v.end(),cmp);
    string ans="";
    for(auto& str:v){
        ans+=str;
    }
    //去除前导零
    while(!ans.empty() and ans[0]=='0') ans.erase(ans.begin());
    if(ans.empty()) cout<<"0";
    else cout<<ans;
    return 0;
}