View Code of Problem 126

#include<algorithm>
#include<string>
#include<iostream>
using namespace std;
struct DNA {
	string a;
	int sum;
}s[100];
bool cmp(DNA x, DNA y) {
	return x.sum < y.sum;
}
int main()
{
	int i, j, k, n, m;
	while (cin>>n>>m) {
		for (i = 0; i < m; i++) {
			cin >> s[i].a;
			s[i].sum = 0;
			for (j = 0; j < n; j++) {
				for (k = j + 1; k < n; k++) {
					if (s[i].a[j] > s[i].a[k]) {
						s[i].sum++;
					}
				}
			}
		}
		sort(s, s + m, cmp);		
		for (i = 0; i < m; i++) {
			cout << s[i].a<<endl;
		}
	}
	return 0;
}