View Code of Problem 126

//DNA排序
#include<stdio.h>
#include<math.h>
int main(){
	int n,m;
	while(scanf("%d %d",&n,&m)!=EOF){
		char s[100][100];
		int i,j,k;
		int v[100]={0};
		for(i=0;i<m;i++){
			int num=0;
			scanf("%s",s[i]);
			for(j=0;j<n;j++){
				for(k=j+1;k<n;k++){
					if(s[i][j]>s[i][k]){
						num++;
					}
				}
			}
			v[i]=num;
		}
		//int min=0;
		int x;
		for(j=0;j<m;j++){
		 //min=v[j];
			int min=10000;
		for(i=0;i<m;i++){
			if(min>v[i]&&v[i]!=-1){
				min=v[i];
				x=i;
			}
		}
			printf("%s\n",s[x]);
			v[x]=-1;	
		
	}
}
	return 0;
} 

Double click to view unformatted code.


Back to problem 126