POJ1007-DNA Sorting

#include<iostream>
using namespace std;
int calculate(char * a,int len)
{
	int deg = 0;
	for (int i = 0; i < len; i++)
		for (int j = i + 1; j < len; j++)
			if (a[i] > a[j])
				deg++;
	return deg;
}
int main()
{
	int m, n;
	cin >> n >> m;
	char **DNA = new char *[m];
	int *deg = new int[m];
	int *ind = new int[m];
	for (int i = 0; i < m; i++) {
		DNA[i] = new char[n];
		cin >> DNA[i];
		deg[i] = calculate(DNA[i], n);
		ind[i] = i;
	}
	for(int i=0;i<m;i++)
		for(int j=0;j<m-i-1;j++)
			if (deg[j] > deg[j + 1]) {
				int temp = deg[j + 1];
				deg[j + 1] = deg[j];
				deg[j] = temp;
				temp = ind[j + 1];
				ind[j + 1] = ind[j];
				ind[j] = temp;
			}
	for (int i = 0; i < m; i++)
		cout << DNA[ind[i]] << endl;
	return 0;
}