水题。
#include<iostream>
#include<stdio.h>
#include<algorithm>
#include<cmath>
using namespace std;
struct str
{
char ch[55];
int n;
}my_ch[102];
bool cmp(str a, str b)
{
return a.n < b.n;
}
int main()
{
int m, n;
cin >> n >> m;
getchar();
for (int i = 0; i < m; i++)
{
gets_s(my_ch[i].ch);
int sum = 0;
for (int j = 0; j < n; j++)
{
for (int k = j+1; k < n; k++)
{
if (my_ch[i].ch[j] > my_ch[i].ch[k])
{
sum++;
}
}
}
my_ch[i].n = sum;
}
sort(my_ch, my_ch + m, cmp);
for (int i = 0; i < m; i++)
{
cout << my_ch[i].ch << endl;
}
return 0;
}