思路很简单，就是冒泡，（string类型可以直接比较大小哟（字典序））

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll N=1e5+1e4,M=1e3+1e2;
const ll Maxn=0x3ffffff,Minm=-0x3ffffff;
ll n;
string s[N];
signed main()
{
    cin>>n;
    for(ll i=1;i<=n;i++)cin>>s[i];
    for(ll i=1;i<n;i++)
    {
        for(ll j=1;j<n;j++)
        {
            if(s[j].size()>s[j+1].size()||(s[j].size()==s[j+1].size()&&s[j]>s[j+1]))swap(s[j],s[j+1]);
        }
    }
    for(ll i=1;i<=n;i++)cout<<s[i]<<"\n";
}