#include<cstdio> #include<iostream> #include<algorithm> #include<cmath> using namespace std; struct Zda{ string data; int len; }zda[105]; bool cmp(Zda a, Zda b){ return a.len < b.len; } int n,m; int nixu(string s){ int sum = 0; for(int i= 0; i< n; i++){ for(int j = i+1; j<n; j++){ if(s[i]>s[j]){ sum++; } } } return sum; } int main(){ while(cin>>n>>m){ for(int i = 0; i<m; i++){ cin>>zda[i].data; zda[i].len =nixu(zda[i].data); } stable_sort(zda, zda+m, cmp); for(int i = 0; i<m; i++){ cout<<zda[i].data<<endl; } } return 0; } |
Double click to view unformatted code.