把数组排成最小数

#include <stdio.h>
#include <stdlib.h>
#include <string.h>  //#include <string>
const int g_MaxNumberLength = 10;

char* g_StrCombine1 = new char[g_MaxNumberLength * 2 + 1];
char* g_StrCombine2 = new char[g_MaxNumberLength * 2 + 1];

int compare(const void* strNumber1, const void* strNumber2)
{
	strcpy(g_StrCombine1, *(const char**)strNumber1);
	strcat(g_StrCombine1, *(const char**)strNumber2);

	strcpy(g_StrCombine2, *(const char**)strNumber2);
	strcat(g_StrCombine2, *(const char**)strNumber1);

	return strcmp(g_StrCombine1, g_StrCombine2);
}

void PrintMinNumber(int* numbers, int length)
{
	if(numbers == NULL || length < 0)
		return ;

	char** strNumbers = (char**)(new int[length]);
	for(int i=0; i<length; i++)
	{
		strNumbers[i] = new char[g_MaxNumberLength + 1];
		sprintf(strNumbers[i], "%d", numbers[i]);
	}

	qsort(strNumbers, length, sizeof(char*), compare);

	for(int j=0; j<length; j++)
		printf("%s", strNumbers[j]);
	printf("\n");

	for(int k=0; k<length; k++)
		delete []strNumbers[k];
	delete[] strNumbers;
}

int main()
{
	int numbers[] = {3, 32, 3210000};
	int length = sizeof(numbers)/sizeof(numbers[0]);  //sizeof(numbers)/sizeof(int)
	PrintMinNumber(numbers, length);

	return 0;
}