1038

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

思路：贪心，每两个组成最小即下面的代码
str.erase(s.begin()) : 移除字符串第一个字母

//亮点代码
bool cmp(string a, string b)
{
    return a+b < b+a;
}

#include <iostream>
#include <vector>
#include <algorithm>
#include <string.h>

using namespace std;

vector<string> v(10005);


bool cmp(string a, string b)
{
    return a+b < b+a;
}


int main()
{
    int n;
    scanf("%d", &n);
    v.resize(n);
    for(int i=0;i<n;i++)
    {
        cin >> v[i];
    }

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

    int len = v[0].length();
    int i=0;
    while(i<len && v[0][i] == '0')
        v[0].erase(v[0].begin());

    if(v[0].length() == 0)
        cout << "0";
    else
    {
        for(int j=0;j<v.size();j++)
        cout << v[j];
    }
    return 0;
}