/*
DNA sorting
TAGS: STL MAP
Memory: 276K Time: 32MS
Language: C++ Result: Accepted
*/
#include <iostream>
#include <string>
#include <cstring>
#include <map>
using namespace std;
#define maxn 110
string data[maxn];
multimap<int,string> result;
void sort_num(int length,string m)
{
int num=0;
for(int j=0;j<length;j++)
for(int i=j+1;i<length;i++)
if(m[i] < m[j])
num ++;
result.insert(make_pair(num,m));
}
int main()
{
int length,words;
while(cin>>length>>words){
result.clear();
memset(data,NULL,sizeof(data));
for(int i=1;i<=words;i++){
cin>>data[i];
sort_num(length,data[i]);
}
multimap<int,string>::iterator map_it = result.begin();
while(map_it != result.end()){
cout<<map_it->second<<endl;
map_it++;
}
}
return 0;
}
poj 1007 DNA sorting
最新推荐文章于 2018-05-02 17:53:23 发布