DNA Sorting
Time Limit: 1000MS | Memory Limit: 10000K | |
Total Submissions: 91873 | Accepted: 36916 |
Description
One measure of ``unsortedness'' in a sequence is the number of pairs of entries that are out of order with respect to each other. For instance, in the letter sequence ``DAABEC'', this measure is 5, since D is greater than four letters to its right and E is greater than one letter to its right. This measure is called the number of inversions in the sequence. The sequence ``AACEDGG'' has only one inversion (E and D)---it is nearly sorted---while the sequence ``ZWQM'' has 6 inversions (it is as unsorted as can be---exactly the reverse of sorted).
You are responsible for cataloguing a sequence of DNA strings (sequences containing only the four letters A, C, G, and T). However, you want to catalog them, not in alphabetical order, but rather in order of ``sortedness'', from ``most sorted'' to ``least sorted''. All the strings are of the same length.
You are responsible for cataloguing a sequence of DNA strings (sequences containing only the four letters A, C, G, and T). However, you want to catalog them, not in alphabetical order, but rather in order of ``sortedness'', from ``most sorted'' to ``least sorted''. All the strings are of the same length.
Input
The first line contains two integers: a positive integer n (0 < n <= 50) giving the length of the strings; and a positive integer m (0 < m <= 100) giving the number of strings. These are followed by m lines, each containing a string of length n.
Output
Output the list of input strings, arranged from ``most sorted'' to ``least sorted''. Since two strings can be equally sorted, then output them according to the orginal order.
Sample Input
10 6 AACATGAAGG TTTTGGCCAA TTTGGCCAAA GATCAGATTT CCCGGGGGGA ATCGATGCAT
Sample Output
CCCGGGGGGA AACATGAAGG GATCAGATTT ATCGATGCAT TTTTGGCCAA TTTGGCCAAA
Source
East Central North America 1998
import java.util.ArrayList;
import java.util.Collections;
import java.util.Comparator;
import java.util.Scanner;
class DNA {
String dna;
int level;
}
public class Main {
public static int getNiXu(String str) {
int count = 0;
for (int i = 0; i < str.length(); i++) {
for (int j = 0; j < i; j++) {
if (str.charAt(j) > str.charAt(i)) {
count++;
}
}
}
return count;
}
public static void main(String[] args) {
// TODO Auto-generated method stub
ArrayList<DNA> dnas = new ArrayList<DNA>();
Scanner reader = new Scanner(System.in);
int m = reader.nextInt();
int n = reader.nextInt();
for (int i = 0; i < n; i++) {
String str = reader.next();
int le = getNiXu(str);
DNA d = new DNA();
d.dna = str;
d.level = le;
dnas.add(d);
}
Collections.sort(dnas, new Comparator<DNA>() {
@Override
public int compare(DNA o1, DNA o2) {
// TODO Auto-generated method stub
return o1.level - o2.level;
}
});
for(int i=0;i<dnas.size();i++){
System.out.println(dnas.get(i).dna);
}
reader.close();
}
}