PKU1007

DNA Sorting
Time Limit:1000MS  Memory Limit:10000K
Total Submit:17097 Accepted:6588

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

 

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