【POJ-1007】DNA Sorting

DNA Sorting

Time Limit: 1000MS		Memory Limit: 10000K
Total Submissions: 86069		Accepted: 34621

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

Source

East Central North America 1998

难度不大，理解 unsortedness是怎么计算的就行。两层循环+结构体

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

struct DNA
{
    int num;
    char str[55];
}DNA[110];

int UnsortedNum(char *str){
    int counter = 0;
    for(int i = 0; i < strlen(str); i++)
        for(int j = i+1; j < strlen(str); j++){
            if (str[i] > str[j]) {
                ++counter;
            }
        }
    return counter;
}

bool cmp(struct DNA a, struct DNA b){
    if(a.num > b.num)
        return false;
    else return true;
}
int main()
{
    int m, n;
    cin>>n>>m;
    for (int i = 0; i < m; i++){
        cin>>DNA[i].str;
        DNA[i].num = UnsortedNum(DNA[i].str);
    }
    sort(DNA, DNA+m, cmp);
    for (int i = 0; i < m; i++) {
        cout<<DNA[i].str<<endl;
    }
    return 0;
}