Problem 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.





This problem contains multiple test cases!



The first line of a multiple input is an integer N, then a blank line followed by N input blocks. Each input block is in the format indicated in the problem description. There is a blank line between input blocks.



The output format consists of N output blocks. There is a blank line between output blocks.

 

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 (1 < 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''. If two or more strings are equally sorted, list them in the same order they are in the input file.

 

Sample Input

1

10 6

AACATGAAGG

TTTTGGCCAA

TTTGGCCAAA

GATCAGATTT

CCCGGGGGGA

ATCGATGCAT

 

Sample Output

CCCGGGGGGA

AACATGAAGG

GATCAGATTT

ATCGATGCAT

TTTTGGCCAA

TTTGGCCAAA

 

记得大一暑假的时候看到这个题也是一脸的懵逼

#include<cstdio>

#include<cstring>

#include<algorithm>

using namespace std;

struct node

{

	char s[55];

	int num,p;

}q[1010];

bool cmp(node s1,node s2)

{

	if(s1.p==s2.p)

	return s1.num<s2.num;

	return s1.p<s2.p;

}

int main()

{

	int t;

	scanf("%d",&t);

	while(t--)

	{

		int n,m;

		scanf("%d%d",&n,&m);

		for(int i=0;i<m;i++)

		{

			scanf("%s",q[i].s);

			q[i].num=i;

			q[i].p=0;

			for(int j=0;j<n;j++)

			{

				for(int k=j+1;k<n;k++)

				{

					if(q[i].s[j]>q[i].s[k])

					{

						q[i].p++;

					}

				}

			}

		}

		sort(q,q+m,cmp);

		for(int i=0;i<m;i++)

		printf("%s\n",q[i].s);

	}

	return 0;

}