2018_2_9_DNA Sorting_排序基础2_字符串

DNA Sorting

Time Limit: 1000MS		Memory Limit: 10000K
Total Submissions: 105789		Accepted: 42385

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

#include<iostream>
#include<cstdio>
#include<cstring>
#include<string> 
#include<cctype>
#include<vector>
#include<algorithm>
#include<map>
#include<set>

using namespace std;

int n,m;
struct AA{
	string s;
	int sum;
	int idx; 
	AA(char c[],int i){
		s=c;
		sum=0;
		idx=i;
		bool have=true;
		string t=c;
		while(have){
			have=false;
			for(int i=1;i<n;i++)
			if(t[i]<t[i-1]){
				swap(t[i],t[i-1]);
				have=true;
				sum++;
			}
		}
	}
};

char c[60];

vector<AA> v;

bool cmp(AA a,AA b){
	if(a.sum==b.sum)return a.idx<b.idx;
	return a.sum<b.sum;
}

int main(){
	scanf("%d%d",&n,&m);
	getchar();
	for(int i=0;i<m;i++){
		gets(c);
		v.push_back(AA(c,i));
	}
	sort(v.begin(),v.end(),cmp);
	for(int i=0;i<m;i++)
	cout<<v[i].s<<endl;
}