Pro.ID21101 TitleDNA Sorting Title链接http://10.20.2.8/oj/exercise/problem?problem_id=21101 AC65 Submit174 Ratio37.36% 时间&空间限制描述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 "AACEDG" 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. 输入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. 输出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 "AACEDG" 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. 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 Sample Output CCCGGGGGGA Source 样例输入10 6 样例输出CCCGGGGGGA 作者 |
|Archiver|手机版|小黑屋|同和创作矩阵
( 粤ICP备20019636号-1 )
GMT+8, 2024-9-21 17:46 , Processed in 0.015529 second(s), 14 queries .
Powered by Discuz! X3.4 Licensed
© 2001-2017 Comsenz Inc.
