|
DNA SortingTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 2203 Accepted Submission(s): 1075
Problem 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. This problem contains multiple test cases! The first line of a multiple input is an integer N, then a blank line followed by N input blocks. Each input block is in the format indicated in the problem description. There is a blank line between input blocks. The output format consists of N output blocks. There is a blank line between output blocks.
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 (1 < 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''. If two or more strings are equally sorted, list them in the same order they are in the input file.
Sample Input
Sample Output
Source
|
翻译:
给你几组字符串,先逐个比较大小,然后排序。
#include<stdio.h>
#include<string.h>
#include<iostream>
#include<algorithm>
using namespace std;
/*bool cmp(kk a,kk b)
{
return a.sum<b.sum;
}*/
struct kk{
char str[100];
int sum;
}jj[100];
bool cmp(kk a,kk b)
{
return a.sum>b.sum;
}
int main()
{
int t;
scanf("%d",&t);
while(t--)
{
int i,j,k;
int n,m;
scanf("%d %d",&n,&m);
for(i=0;i<m;i++)
{
scanf("%s",jj[i].str);
jj[i].sum=0;
for(j=0;j<n;j++)
{
for(k=j+1;k<n;k++)
{
if(jj[i].str[j]<=jj[i].str[k])
jj[i].sum++;
}
}
}
sort(jj,jj+m,cmp);
for(i=0;i<m;i++)
printf("%s\n",jj[i].str);
}
return 0;
}