DNA Sorting
Time Limit: 1000MS | Memory Limit: 10000K | |
Total Submissions: 81963 | Accepted: 32982 |
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.
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 <iostream>
#include <stdio.h>
#include<algorithm>
using namespace std;
struct DNA
{
string s;
int count;
};
int cmp(const void *D1,const void *D2)
{
DNA *d1=(DNA *)D1;
DNA *d2=(DNA *)D2;
return d1->count-d2->count;
}
int main()
{
DNA d[101];
int n,m;
cin>>n>>m;
for (int i=0; i<m; i++)
{
cin>>d[i].s;
d[i].count=0;
for (int k=0; k<d[i].s.size(); k++)
{
for (int j=k+1; j<d[i].s.size(); j++)
{
if(d[i].s[k]>d[i].s[j])
{
d[i].count++;
}
}
}
}
qsort(d, m, sizeof(DNA), cmp);
for (int i=0; i<m; i++)
{
cout<<d[i].s<<endl;
}
return 0;
}