View Code of Problem 143

#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].size();++j){
			for(int k=j+1;k<s[i].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;
}
 
/*
Main.cc: In function `int main()':
Main.cc:20: error: 'struct node' has no member named 'size'
Main.cc:21: error: 'struct node' has no member named 'size'
*/