百练 1007 DNA Sorting

# include <stdio.h>
# include <iostream>
# include <algorithm>
# include <string.h>
using namespace std;
char a[100][100];
int ans[100][100];
struct nod
{ 
	int xx; 
	int id;
}s[100];
int cmp(nod a,nod b)
{
	return a.xx<b.xx;
}
int main()
{
	int n,x;
	int i,j,k;
	while(scanf("%d%d",&x,&n)==2)
	{
		memset(ans,0,sizeof(ans)); 
		for(i=0;i<n;i++) 
		{
			s[i].xx=0; 
			s[i].id=i;
		}
		for(i=0;i<n;i++)
			scanf("%s",a[i]); 
		for(i=0;i<n;i++)
			for(j=0;j<x;j++) 
				for(k=j;k<x;k++) 
					if(a[i][j]>a[i][k])
						ans[i][j]++; 
					for(i=0;i<n;i++) 
					{
						for(j=0;j<x;j++) 
						{
							s[i].xx+=ans[i][j];
						}
					}
					sort(&s[0],&s[n],cmp); 
					for(i=0;i<n;i++) 
						printf("%s\n",a[s[i].id]);
	}
	return 0;
}