#include <iostream> #include <string> #include <algorithm> #include <cstdio> using namespace std; typedef struct { string str; int num; }DNA; DNA d[100]; bool cmp(DNA a,DNA b) { return a.num<b.num; } int main(void) { int m,n; cin>>m>>n; int i=0; for(;i<n;i++) { cin>>d[i].str; d[i].num=0; for(int k=1;k<m;k++) { for(int j=0;j<k;j++) { if(d[i].str[k]<d[i].str[j]) d[i].num++; } } } stable_sort(d,d+n,cmp); for(i=0;i<n;i++) { cout<<d[i].str<<endl; } return 0; } |
Double click to view unformatted code.