DNA Sorting

DNA Sorting

Time Limit: 1000MS		Memory Limit: 10000K
Total Submissions: 105159		Accepted: 42124

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.

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

题目大意：

序列“未排序程度”的一个计算方式是元素乱序的元素对个数。例如：在单词序列“DAABEC'”中，因为D大于右边四个单词，E大于C，所以计算结果为5。这种计算方法称为序列的逆序数。序列“AACEDGG”逆序数为1（E与D）——近似排序，而序列``ZWQM'' 逆序数为6（它是已排序序列的反序）。

你的任务是分类DNA字符串（只有ACGT四个字符）。但是你分类它们的方法不是字典序，而是逆序数，排序程度从好到差。所有字符串长度相同。

输入：

第一行包含两个数：一个正整数n（0<n<=50）表示字符串长度，一个正整数m（0<m<=100）表示字符串个数。接下来m行，每行一个长度为n的字符串。

输出：

输出输入字符串列表，按排序程度从好到差。如果逆序数相同，就原来顺序输出。

#include <iostream>
#include <stdio.h>
#include <algorithm>
using namespace std;
typedef struct node{
    char d[];
    int value;
}DNA;
int GetValue(char *s,int len)
{
    int value=;
    char temp;
    for(int i=;i<len-;i++)
    {
        temp = s[i];
        for(int j=i+;j<len;j++)
        {
            if(temp>s[j]) value++;
        }
    }
    return value;
}
bool MyCom(DNA a,DNA b)
{
    return a.value<b.value;
}
int main()
{
    int len,n;
    DNA MyDNA[];
    scanf("%d%d",&len,&n);
    //DNA *MyDNA = new DNA[n];
    for(int i=;i<n;i++)
    {
        scanf("%s",MyDNA[i].d);
        MyDNA[i].value = GetValue(MyDNA[i].d,len);
    }

    sort(MyDNA,MyDNA+n,MyCom);

    for(int i=;i<n;i++){
        cout<<MyDNA[i].d<<"\0"<<endl;
    }
    delete []MyDNA;
    return ;
}

排序部分可以用<algorithm>里面的sort，也可以是自定义的。输入部分如果将scanf改为cin.getline(d[i].s, m+1)则需要先用一个scanf("%c", &c)读取两个整数之后的回车符。

sort对结构体中某一元素进行排序

 #include <iostream>
 #include <vector>
 #include <algorithm>
 using namespace std;
 typedef struct example
 {
     int elem1;
     int elem2;
 }example;
 /*这个comparison函数很重要.如果希望升序排序,就是"<",降序排列就是">"号,这样便于直观记忆.如果希望用elem2作为比较标准
 就把elem1改为elem2,这样结构体就以elem2为比较标准排序了.*/
 bool comparison(example a,example b){
     return a.elem1<b.elem1;
 }
 int main()
 {
     int N;
     fin>>N;
    vector<example> array(N);
    for(int i=;i<N;i++)
     {
         fin>>array[i].elem1>>array[i].elem2;
     }
    sort(array.begin(),array.end(),comparison搜索);
    for(int i=;i<N;i++)
     {
         cout<<array[i].elem1<<" "<<array[i].elem2<<endl;
     }
        return ;
 }