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

 1 #include <iostream>
 2 #include <string>
 3 #include <vector>
 4 #include <algorithm>
 5
 6 using namespace std;
 7
 8 bool cmp(const string& s1, const string& s2)
 9 {
10     return s1 + s2 < s2 + s1;
11 }
12
13 int main()
14 {
15     int segNum;
16     vector<string> segment;
17     cin >> segNum;
18     for (int i = 0; i < segNum; i++)
19     {
20         string seg;
21         cin >> seg;
22         segment.push_back(seg);
23     }
24     sort(segment.begin(), segment.end(), cmp);
25     string res;
26     for (int i = 0; i < segment.size(); i++)
27         res += segment[i];
28
29     string::iterator it = res.begin();
30     while (*it == ‘0‘)
31         it = res.erase(it);
32
33     if (res.empty())
34         cout << "0";
35     else
36         cout << res;
37 }