DNA Sorting

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<stdio.h>
#include<vector>
#include<algorithm>
#include<string.h>
using namespace std;
struct node
{
  char DNA[60];
  int value;
  int order;
};
bool cmp(struct node a,struct node b)
{
    if(a.value!=b.value)
    {
        return a.value<b.value;
    }
    else
    {
        return a.order>b.order;
    }
}
vector<struct node> v;
int main()
{
    int i,j,n,m,k,t;
    char str[60];
    scanf("%d %d",&n,&m);
    for(i=0;i<m;i++)
    {
        struct node tmp;
        int A=0,C=0,G=0,T=0;
        int value=0;
        scanf("%s",str);
        for(j=strlen(str)-1;j>=0;j--)
        {
            if(str[j]=='A')
             {
                 A++;
             }
            else if(str[j]=='C')
            {
                C++;
            }
            else if(str[j]=='G')
            {
                G++;
            }
            else if(str[j]=='T')
            {
                T++;
            }
            if(str[j]>'A')
            {
              value+=A;
            }
            if(str[j]>'C')
            {
                value+=C;
            }
            if(str[j]>'G')
            {
                value+=G;
            }
            if(str[j]>'T')
            {
                value+=T;
            }
        }
        strcpy(tmp.DNA,str);
        tmp.value=value;
        tmp.order=i;
        v.push_back(tmp);
    }
    sort(v.begin(),v.begin()+m,cmp);
    for(i=0;i<m;i++)
    {
        printf("%s\n",v[i].DNA);
    }
    return 0;
}