POJ 1007 DNA Sorting

DNA Sorting

Time Limit: 1000MS		Memory Limit: 10000K
Total Submissions: 103246		Accepted: 41368

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 Code
    Problem: 1007        User: zhaopeng938
    Memory: 304K        Time: 16MS
    Language: C++        Result: Accepted

Source Code

#include<iostream>
//#include<fstream>
#include<string>
#include<vector>
using namespace std;
int main()
{
    //ifstream in("test.txt");
    vector<string> arr;
    vector<int> sort;
    int n,m;
    cin>>n>>m;
    int i,j,k;
    for(i=0;i<m;i++)
    {
        string temp;
        cin>>temp;
        arr.push_back(temp);
        int num=0;
        for(j=0;j<arr[i].size()-1;j++)
            for(k=j+1;k<arr[i].size();k++)
                if(arr[i][j]>arr[i][k])
                    num++;
        sort.push_back(num);
    }
    //for(i=0;i<arr.size();i++)
        //cout<<arr[i]<<" "<<sort[i]<<endl;
    for(i=sort.size()-1;i>0;i--)
    {
        for(j=0;j<i;j++)
        {
            if(sort[j]>sort[j+1])
            {
                int ls_num;
                ls_num=sort[j];
                sort[j]=sort[j+1];
                sort[j+1]=ls_num;

                string ls_temp;
                ls_temp=arr[j];
                arr[j]=arr[j+1];
                arr[j+1]=ls_temp;
            }
        }
    }
    for(i=0;i<arr.size();i++)
        cout<<arr[i]<<endl;
    return 0;
}