#include<iostream> #include<algorithm> using namespace std; struct node{ string s; int ret; }; bool cmp(struct node x,struct node y){ return x.ret<y.ret; } int main(){ int n,m; while(scanf("%d %d",&n,&m)!=EOF){ struct node s[m]; for(int i=0;i<m;++i) s[i].ret=0; for(int i=0;i<m;++i){ cin>>s[i].s; for(int j=0;j<s[i].s.size();++j){ for(int k=j+1;k<s[i].s.size();++k){ if(s[i].s[j]>s[i].s[k]) ++s[i].ret; } } } sort(s,s+m,cmp); for(int i=0;i<m;++i){ cout<<s[i].s<<endl; } } return 0; } |
Double click to view unformatted code.