1038. Recover the Smallest Number (30)

题目连接：https://www.patest.cn/contests/pat-a-practise/1038

这道题，无语了……参考了他人的代码

#include<stdio.h>
#include<algorithm>
#include<vector>
#include<string>
#include<iostream>

using namespace std;
int cmp(string a,string b)
{
    return a+b<b+a;
}

int main()
{
    int N,i;
    vector<string>num;
    scanf("%d",&N);
    string tmp;
    for (i=0;i<N;i++)
    {
        cin>>tmp;
        num.push_back(tmp);
    }
    sort(num.begin(),num.end(),cmp);

    string ans;
    int non=-1;
    for (i=0;i<num.size();i++)ans+=num[i];
    for (i=0;i<ans.size();i++)
    {
        if (ans[i]!='0')
        {
            non=i;
            break;
        }
    }
    if (non==-1)printf("0\n");
    else
    {
        ans=ans.substr(non);
        cout<<ans<<endl;
    }
    return 0;
}