PAT1038 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 (<=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

分析：最大的问题就是字典序排序之后组合为什么不行，原因就是大约存在子串的情况，比如32，321是32321，但是正确是32132.用暴力的化有N！种方法，我们换一种策略，如果用a+b<b+a来判断的话，可以保证第一个永远是组合后最小的，第二个其次，和排序一样。结果扫一遍即可

#include <bits/stdc++.h>

using namespace std;

int n;
string a[10005];
bool cmp(string a,string b)
{
    return a+b<b+a;
}

int main()
{
    cin>>n;

    for(int i=0; i<n; i++) cin>>a[i];
    sort(a,a+n,cmp);
    for(int i=0; i<n; i++) cout<<a[i]<<' ';
    cout<<endl;
    string ans;
    for(int i=0; i<n; i++) ans+=a[i];

    while(ans.size()&&ans[0]=='0')
    {
        ans.erase(ans.begin());
    }
    if(ans.size()==0)
    {
        cout<<0;
        exit(0);
    }
    cout<<ans;

    return 0;
}