pat-1038 Recover the Smallest Number(30)（贪心，对cmp的巧妙改写）

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 (≤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

作者: CHEN, Yue

单位: 浙江大学

时间限制: 200 ms

内存限制: 64 MB

代码长度限制: 16 KB

 

这道题的难度就在于改写cmp函数了，为了让输出的数字最小，打个比方，有两个string型的字符串s1,s2，如果满足s1 + s2 < s2 + s1，那么就是说，s1放前面，s2放后面时，得到的数字更小.然后sort一下就好了。看到这里如果觉得还想再深入了解，可以看一下下面的证明。

【书上对cmp函数的详细证明】 

#include <iostream>
#include <algorithm>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <cstdio>
#include <vector>
using namespace std;
string str[10005];
bool cmp(string x,string y)
{
    return x + y < y + x;
}
int main()
{
    int n;
    cin>>n;
    for(int i = 0 ; i < n;i++)
    {
        cin>>str[i];
    }
    sort(str,str + n,cmp);
    string ans;
    for(int i = 0;i < n;i++)
    {
        ans += str[i];
    }
    while(ans.size() != 0 && ans[0] == '0')
    {
        ans.erase(ans.begin());
    }
    if(ans.size() == 0)
        cout<<"0"<<endl;
    else
        cout<<ans<<endl;

    return 0;
}