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 87Sample Output:
22932132143287
# include <cstdio>
# include <iostream>
# include <string>
using namespace std;
const int _size = 10000;
string num[_size];
bool cmp(const string& a,const string& b){return a + b< b + a;}
int main()
{
int n,i;
cin >> n;
for (i=0;i<n;i++)
cin >> num[i];
sort(num,num+n,cmp);
string out;
for (i=0;i<n;i++)
out += num[i];
for (i=0;i<out.size()&&out[i]=='0';i++);
if (i==out.size())
printf("0");
else
printf("%s",out.c_str()+i);
printf("\n");
return 0;
}