pat 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

两个字符串连接起来进行比较，可以保证最后字典序最小。

 

#include<iostream>
using namespace std;
#include<stdio.h>
#include<vector>
#include<map>
#include<queue>
#include<string.h>
#define MS(a,b) memset(a,b,sizeof(a))
#include<algorithm>
int n;
bool cmp(string a,string b)
{
    return a+b<b+a;
}
int main()
{
   string str[10005],s;
   int i,flag;
   scanf("%d",&n);
   for(i=0;i<n;i++)
     cin>>str[i];
    sort(str,str+n,cmp);
//这样排序可以保证最后连起来的字符串字典序最小。
    s="";
    for(i=0;i<n;i++)
      s=s+str[i];
      flag=0;
      for(i=0;i<s.size();i++)
      {
         if(s[i]=='0'&&!flag)continue;
         else
         {
            flag=1;
            cout<<s[i];
         }
      }
      if(!flag)cout<<"0";//全部都是0的话，只输出一个0.
      cout<<endl;
    return 0;
}