View Code of Problem 126

import java.util.Arrays;
import java.util.Collections;
import java.util.List;
import java.util.Scanner;
 
public class Main {
	public static void main(String[] args) {
		Scanner scanner = new Scanner(System.in);
		while(scanner.hasNext()) {
			int len = scanner.nextInt();
			int num = scanner.nextInt();
			Dna[] ds = new Dna[num];
			for(int i=0; i<num; i++) {
				String s = scanner.next();
				int count = 0;
				for(int j=0; j<len-1; j++) {
					for(int k=j+1; k<len; k++) {
						if(s.charAt(j) > s.charAt(k)) {
							count++;	
						}
					}
				}
				ds[i] = new Dna(s,count);
			}
			Arrays.sort(ds);
			for(Dna d:ds) {
				System.out.println(d.str);
			}
		}
	}
}
class Dna implements Comparable<Dna>{

	String str;
	public Dna(String str, int count) {
		super();
		this.str = str;
		this.count = count;
	}
	int count;
	@Override
	public int compareTo(Dna o) {
		// TODO Auto-generated method stub
		return this.count - o.count;
	}
	
}