poj 1007

                                             DNA Sorting

Time Limit: 1000MS		Memory Limit: 10000K
Total Submissions: 73949		Accepted: 29577

Description

One measure of ``unsortedness'' in a sequence is the number of pairs of entries that are out of order with respect to each other. For instance, in the letter sequence ``DAABEC'', this measure is 5, since D is greater than four letters to its right and E is greater than one letter to its right. This measure is called the number of inversions in the sequence. The sequence ``AACEDGG'' has only one inversion (E and D)---it is nearly sorted---while the sequence ``ZWQM'' has 6 inversions (it is as unsorted as can be---exactly the reverse of sorted).

You are responsible for cataloguing a sequence of DNA strings (sequences containing only the four letters A, C, G, and T). However, you want to catalog them, not in alphabetical order, but rather in order of ``sortedness'', from ``most sorted'' to ``least sorted''. All the strings are of the same length.

Input

The first line contains two integers: a positive integer n (0 < n <= 50) giving the length of the strings; and a positive integer m (0 < m <= 100) giving the number of strings. These are followed by m lines, each containing a string of length n.

Output

Output the list of input strings, arranged from ``most sorted'' to ``least sorted''. Since two strings can be equally sorted, then output them according to the orginal order.

Sample Input

10 6
AACATGAAGG
TTTTGGCCAA
TTTGGCCAAA
GATCAGATTT
CCCGGGGGGA
ATCGATGCAT

Sample Output

Sample Output

CCCGGGGGGA
AACATGAAGG
GATCAGATTT
ATCGATGCAT
TTTTGGCCAA
TTTGGCCAAA

Source

East Central North America 1998

题目大概意思是为每个字串定义一个权值（其逆序对数），按照权值由小到大输出。

用a[i][0]存字串编号，a[i][1]存逆序对数，按a[i][1]排序后，输出s[a[i][0]]。因为数据较小，求逆序对简单模拟即可。

代码如下

#include<iostream>
using namespace std;
int main()
{
	int n,m,i,j,k,a[101][2]={0},c;
	char s[101][51];
	cin>>n>>m;
	for (i=1;i<=m;i++)
	{
		cin>>s[i];
		a[i][0]=i;
		for (j=0;j<n;j++)
			for (k=j+1;k<n;k++)
				if (s[i][j]>s[i][k])
					a[i][1]++;
	}
	for (i=1;i<=m-1;i++)
		for (j=i+1;j<=m;j++)
			if (a[i][1]>a[j][1])
			{
				c=a[i][1];
				a[i][1]=a[j][1];
				a[j][1]=c;
				c=a[i][0];
				a[i][0]=a[j][0];
				a[j][0]=c;
			}
	for (i=1;i<=m;i++)
		cout<<s[a[i][0]]<<endl;
	return 0;
}