NYOJ 160 DNA Sorting

DNA Sorting

时间限制： 1000 ms  |  内存限制： 65535 KB

难度： 2

描述

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. 

输入

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

样例输入

10 6
AACATGAAGG
TTTTGGCCAA
TTTGGCCAAA
GATCAGATTT
CCCGGGGGGA
ATCGATGCAT

样例输出

CCCGGGGGGA
AACATGAAGG
GATCAGATTT
ATCGATGCAT
TTTTGGCCAA
TTTGGCCAAA

注：排序的话切记不能用sort（），因为它是不稳定排序，需要用stable_sort()稳定排序！！
#include<iostream>
#include<string>
#include<algorithm>
using namespace std;
struct DNA
{
	string dna;
	int count;
} d[101];
int cmp(DNA a,DNA b)
{
 return a.count<b.count;
}
int main()
{
	int n,m,i,j,k;
	char c;
	cin>>n>>m;
	for(i=0;i<m;i++)
	{
	  cin>>d[i].dna;
	  d[i].count = 0;
	  for(j=0;j<n;j++)
		  for(k=j+1;k<n;k++)
		  {
		   if(d[i].dna[j]>d[i].dna[k])
			   d[i].count++;
		  }
	}
	stable_sort(d,d+m,cmp);
	for(i=0;i<m;i++)
		cout<<d[i].dna<<endl;
 return 0;
}