Solution DNA Sorting

Link đề bài: http://acm.pku.edu.cn/JudgeOnline/problem?id=1007

DNA Sorting
Time Limit: 1000MS Memory Limit: 10000K
Total Submissions: 48041 Accepted: 18810

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

Source Code
Problem: 1007 User: ductam1983
Memory: 172K Time: 0MS
Language: C Result: Accepted

* Source Code

#include
// #include


// const char *INP="TEST.INP";



char s[101][51];
int order[101];
int index[101];
int N,M;

void Sort(int t,int p);

int main()
{
int i;
int k,t;
int count;
// FILE *f;
// f=fopen(INP,"rb");
// fscanf(f,"%d%d",&N,&M);
scanf("%d%d",&N,&M);
for(i=0;i {
// fscanf(f,"%s",s[i]);
scanf("%s",s[i]);
index[i]=i;
count=0;
for(k=0;k for(t=k+1;t if(s[i][k]>s[i][t]) count++;
order[i]=count;
}
Sort(0,M-1);
for(i=0;i printf("%s\n",s[index[i]]);
// getch();
return 0;
}
void Sort(int t,int p)
{
int l,r,mid,valtemp,valmid;
l=t;
r=p;
mid=(l+r)/2;
valmid=order[mid];
while(l<=r)
{
while(order[l] while(order[r]>valmid) r--;
if(l<=r)
{
valtemp=order[l];
order[l]=order[r];
order[r]=valtemp;

valtemp=index[l];
index[l]=index[r];
index[r]=valtemp;
l++;
r--;
}
}
if(l if(t }