pat1038. Recover the Smallest Number (30)

1038. Recover the Smallest Number (30)

时间限制

400 ms

内存限制

65536 kB

代码长度限制

16000 B

判题程序

Standard

作者

CHEN, Yue

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

---

提交代码

 

 

学习网址：http://blog.csdn.net/sinat_29278271/article/details/48047877

里面的传递性是可以证明的

 

#include<cstdio>
#include<algorithm>
#include<iostream>
#include<cstring>
#include<queue>
#include<vector>
#include<cmath>
#include<string>
using namespace std;
vector<string> v;
bool cmp(string a,string b){
    return a+b<b+a;
}
int main(){
    //freopen("D:\\INPUT.txt","r",stdin);
    int n,i;
    scanf("%d",&n);
    string s;
    for(i=0;i<n;i++){
        cin>>s;
        v.push_back(s);
    }
    sort(v.begin(),v.end(),cmp);
    s="";
    for(i=0;i<n;i++){
        s=s+v[i];
    }
    for(i=0;i<s.length();i++){
        if(s[i]!='0'){
            break;
        }
    }

    if(i==s.length()){
        printf("0\n");
    }
    else{
        for(;i<s.length();i++){
            cout<<s[i];
        }
        cout<<endl;
    }
    return 0;
}