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 (≤104) 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
解题思路:
对于两个数,交换顺序,选择值较小的顺序。
AC代码:
#include<bits/stdc++.h>
using namespace std;
bool cmp(string a,string b){
return a+b<b+a;
}
int main(){
vector<string> a;
int n,i;
cin>>n;
char str[5];
for(i=0;i<n;i++){
scanf("%s",str);
a.push_back(str);
}
sort(a.begin(),a.end(),cmp);
string s;
for(i=0;i<n;i++)
s+=a[i];
while(!s.empty()&&s[0]=='0')
s.erase(s.begin());
if(s.empty())
cout<<0<<endl;
else cout<<s<<endl;
return 0;
}