PAT甲级真题 1038 Recover the Smallest Number (30分)（自定义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 (<=10000) 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. Do not output leading zeros.
Sample Input:
5 32 321 3214 0229 87
Sample Output:
22932132143287

思路

用字符串数组存储数字，自定义compare函数，将两个字符串分别前后组合，若s1+s2 < s2+s1，则将s1放到s2前面。

对整个数组排序后，将所有字符串连接成一个字符串（方便处理前面的0，因为前面可能有多个字符串均为0，如00 00 01），从第一个非’0’的位置输出即可。

注意不能简单按字典序排序，比如测试用例：
2 12 121
应输出：
12112

字符串比较的话是121 > 12，而正确答案应是121在前，12在后。

代码

#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

bool cmp(string &s1, string &s2){
    return s1+s2 < s2+s1;
}
int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);

    int n;
    cin >> n;
    vector<string> s(n);
    for (int i=0; i<n; i++){
        cin >> s[i];
    }

    sort(s.begin(), s.end(), cmp);

    string str = "";
    for (int i=0; i<n; i++){
        str += s[i];
    }
    int pos = 0;
    while (pos<str.size() && str[pos]=='0'){
        pos++;
    }
    if (pos==str.size())  {
        cout << "0";
    }
    while (pos<str.size()){
        cout << str[pos];
        pos++;
    }
    cout << endl;
    return 0;
}