归并排序求逆序对

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

题解：只有A，C，G，T 四个字母，所以逆序很好求，再用结构体把字符串和逆序连接为一个整体，用sort排序即可；

貌似没有用到归并排序......

代码：

#include <iostream>
#include <string>
#include <cstring>
#include <algorithm>
using namespace std;

struct node
{
    string s;
    int nixu;
};

bool cmp(node x,node y)
{
    return x.nixu<y.nixu;
}
int main()
{
    int n,m;
    while(cin>>n>>m)
    {
        struct node p[100];
        for(int i=0;i<m;i++)
        {
            int a=0,c=0,g=0,t=0,sum=0;
            cin>>p[i].s;
            for(int j=0;j<n;j++)
            {
                if(p[i].s[j]=='A')
                {
                    sum=sum+c+g+t;
                    a++;
                }
                else if(p[i].s[j]=='C')
                {
                    sum=sum+g+t;
                    c++;
                }
                else if(p[i].s[j]=='G')
                {
                    sum=sum+t;
                    g++;
                }
                else if(p[i].s[j]=='T')
                    t++;
            }
            p[i].nixu=sum;
        }
        sort(p,p+m,cmp);
        for(int i=0;i<m;i++)
            cout<<p[i].s<<endl;
    }
    return 0;
}