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 (≤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

结尾无空行

/*思路：字符串合并排序，最后删除前导0，如果长度为0则输出0，否则直接打印*/
#include <bits/stdc++.h>
using namespace std;
bool cmp(string a,string b) {return a+b<b+a;}
int main()
{
    int n;
    scanf("%d",&n);
    vector<string> str(n);
    string ans="";
    for(int i=0;i<n;i++) cin>>str[i];
    sort(str.begin(),str.end(),cmp);
    for(int i=0;i<str.size();i++) ans+=str[i];
    while(ans.length()>0&&ans[0]=='0') ans.erase(ans.begin());
    if(ans.length()==0) cout<<"0";
    else cout<<ans;
    return 0;
}