poj 1007

#include<iostream>#include<fstream>#include<algorithm>#include<vector>using namespace std;struct node{    string s;    int val;};bool comp(const node &node1,const node &node2){    return node1.val<=node2.val;}int main(){    //ifstream cin("1.txt");    int n,m;    cin>>n>>m;    string s;    vector<node> vnode;    for(int i=0;i<m;++i){        cin>>s;        node nod;        nod.s=s;        int val=0;        for(int k=0;k<s.length();++k)            for(int j=k+1;j<s.length();++j){                if(s[k]>s[j])                   val++;            }        nod.val=val;        vnode.push_back(nod);    }    sort(vnode.begin(),vnode.end(),comp);    for(int i=0;i<vnode.size();++i)        cout<<vnode[i].s<<endl;    return 0;}