pat-a1038. Recover the Smallest Number (30)

来源：互联网发布：linux嵌入式开发招聘编辑：程序博客网时间：2024/05/29 18:03

这个题在于按什么规则排序

刚开始想的是比较两个字符串长度，如果长度不同，短的补自己第一个字符，补到相同时比较大小。。这样做测试点有一个没过。排序规则不对。比如321和3213，按这个规则谁在前不影响，然而321排前面才对。加另一个字符串

排在前面还是后面加起来比较大小就行了。以前做过类似的没注意。慢慢刷吧

#include<iostream>#include<string>#include<algorithm>using namespace std;string sqe[10010];bool cmp(const string& a,const string& b){return a+b<b+a;}int main(){int n,t,po=-1,pos=-1;cin>>n;for(int i=0;i<n;++i) cin>>sqe[i];sort(sqe,sqe+n,cmp);for(int i=0;i<n;++i){int len=sqe[i].size();for(int j=0;j<len;++j) if(sqe[i][j]!='0'){ po=i; pos=j; break; } if(po!=-1) break;}if(po!=-1){   cout<<sqe[po].substr(pos,sqe[po].size()-pos);   for(int i=po+1;i<n;++i) cout<<sqe[i];    }    else cout<<'0';cout<<endl;return 0;}

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

0 0