PAT (Advanced Level) Practice 1038 Recover the Smallest Number (30 分)（贪心排序）

好像在哪做过原题

#include <iostream>
#include <algorithm>
#include <vector>
#include <string.h>
using namespace std;
#define ll long long
const ll inf=0x3f3f3f3f;
#define read(x) scanf("%lld",&x)


string s[10005];
bool cmp(string t1,string t2)
{
    return t1+t2<t2+t1;
}
int main()
{
    ll n;
    read(n);
    for(int i=0;i<n;i++)cin>>s[i];
    sort(s,s+n,cmp);
    string ans="";
    for(int i=0;i<n;i++)ans+=s[i];ll num=0;
    for(int i=0;i<ans.size();i++)
    {
        if(ans[i]=='0')num++;
        else break;
    }
    ans.erase(0,num);
    if(ans.size()==0)cout<<0<<'\n';
    else cout<<ans<<'\n';
}