> 我的代码，跟你的差不多，wa
#include <cstdlib>
#include <iostream>

using namespace std;

int count_inver(char *str, int len);

int main(int argc, char *argv[])
{
    int m,n;
    int i,j;
    cin>>m>>n;
    char **sort=new char *[n];
    for(i=0;i<n;i++)
    {
        sort[i]=new char[m+1];
        } 
    int *ress=new int[n];//存放每一行的unsortedness值
    for(i=0;i<n;i++)//输入数据
    {
		cin>>sort[i];
	}
	char *temp;
	for(i=0;i<n;i++)
		ress[i]=count_inver(sort[i],m);
	for(i=0;i<n;i++)
	{
	//	cout<<ress[i]<<endl;
		for(j=i;j<n;j++)
			if(ress[i]<ress[j])
			{
				temp=sort[i];
				sort[i]=sort[j];
				sort[j]=sort[i];
			}
	}
	for(i=0;i<n;i++)
		cout<<sort[i]<<endl;

}


int count_inver(char *str, int len)
{
	int i;  
	int cnt = 0;
	int a[4] = {0};
	for(i = len - 1; i >= 0; i--) {
		switch (str[i]) {
		case 'A':
			a[1]++; 
			a[2]++; 
			a[3]++; 
			break;  
		case 'C':
			a[2]++; 
			a[3]++; 
			cnt += a[1];
			break;  
		case 'G':
			a[3]++; 
			cnt += a[2];
			break;  
		case 'T':
			cnt += a[3];
		}
	}
	return cnt;
}