poj-1007 DNA sorting

F - DNA Sorting

 

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

#include<algorithm>

using namespace std;

struct zhege

{

    char zimu[101];

    int num;

};

int cmp(struct zhege q,struct zhege w)

{

    return q.num<w.num;

}

int main()

{

    int n,m;

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

    struct zhege e[1001];

    int i,j,k;

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

    {

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

        e[i].num=0;

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

        {

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

            {

                if(e[i].zimu[j]>e[i].zimu[k])

                    e[i].num++;

            }

        }

    }

    sort(e,e+m,cmp);

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

    {

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

    }

    return 0;

}

 

 

注意：C++ 输入