C++ 代码
#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
string s[202];
int n;
bool cmp(string s1, string s2)
{
if(s1.length() == s2.length())
{
int leng = s1.length();
for(int i = 0; i < leng ; i ++)
{
char a = s1[i], b = s2[i];
if(a != b) return a < b;
}
}
else
{
return s1.length() < s2.length();
}
}
int main()
{
scanf("%d", &n);
for(int i = 0;i < n ; i ++)
{
cin>>s[i];
}
sort(s, s + n, cmp);
for(int i = 0; i < n; i ++)
cout<<s[i]<<endl;
return 0;
}