HDU DNA Sorting

DNA Sorting

Time Limit : 2000/1000ms (Java/Other)   Memory Limit : 20000/10000K (Java/Other)

Total Submission(s) : 3   Accepted Submission(s) : 2

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.

 

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

  
  

   
   CCCGGGGGGA
AACATGAAGG
GATCAGATTT
ATCGATGCAT
TTTTGGCCAA
TTTGGCCAAA
  
  

 

Source

PKU

 

 

#include <cstdio>
#include <iostream>
#include <algorithm>
using namespace std;
struct DNA
{
	char ID[55];
	int num;
	bool operator < (const DNA& t) const 
	{
		return num < t.num;
	}
}a[105];

int main()
{
	int n, total,  m, i, j, k;
	while(scanf("%d%d",&n,&m)!=EOF)
	{
		for(i=0; i<m; i++) cin>>a[i].ID;
		for(i=0; i<m; i++)
		{
			total = 0;
			{for(j=0; j<n;j++)
				for(k=j+1; k<n; k++)
					if(a[i].ID[j] > a[i].ID[k])
						total++;}
			a[i].num = total;
		}		
		sort(a,a+m);
		for(i=0; i<m; i++)
			printf("%s\n",a[i].ID);
	}
	return 0;
}