POJ 1007

#include <iostream>
using namespace std;

int main()
{
char str[110][110];
int len[110] = {0};
int flag[110] = {0};
int n, m, i, j, k, max = 0, min;
cin >> n >> m;
for (i = 0; i < m; i++)
{
cin >> str[i];
for (j = 0; j < n; j++)
{
for (k = j+1; k < n; k++)
{
if (str[i][j] > str[i][k])
{
len[i]++;
}
}
}
if (len[i] > max)
{
max = len[i];
}
}
for (i = 0; i < m; i++)
{
min = max + 1;
for (j = 0; j < m; j++)
{
if (len[j] < min && flag[j] == 0)
{
min = len[j];
k = j;
}
}
flag[k] = 1;
cout << str[k] << endl;
}
return 0;
}