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.

输入

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 6AACATGAAGGTTTTGGCCAATTTGGCCAAAGATCAGATTTCCCGGGGGGAATCGATGCAT

样例输出

CCCGGGGGGAAACATGAAGGGATCAGATTTATCGATGCATTTTTGGCCAATTTGGCCAAA

#include<iostream>
#include<cstdio>
#include<cstring>
#include<malloc.h>
#include<cmath>
#include<algorithm>
using namespace::std;
int m;
int n;
struct stu{
    char c[55];
    int num;
}s[1005];
bool comp(stu a,stu b){
    return a.num<b.num;
}
int main(){
    while(~scanf("%d %d",&n,&m)){
        int i,j,k;
        for(i=0;i<m;i++){
            scanf("%s",s[i].c);
            s[i].num=0;
            for(j=0;j<n-1;j++){
                k=j+1;
                while(k<=n){
                    if(s[i].c[j]>s[i].c[k])
                        s[i].num++;
                    k++;
                }
            }
            //cout<<s[i].num<<endl;
        }
        sort(s,s+m,comp);
        for(i=0;i<m;i++)
            printf("%s\n",s[i].c);
    }
    return 0;
}