HDU's ACM 1040 As Easy As A+B

原题链接：HDU's ACM 1040 As Easy As A+B

分析：题目表述的很清楚，只是单纯的排序。因为N<=10^3，所以可以选用O(n^2)的排序算法（？未亲自验证）。

注意：库函数 qsort

AC Code:

<span style="font-family:Microsoft YaHei;font-size:14px;">#include <stdio.h>
#include <stdlib.h>

#define MAXN 1000+10

int num[MAXN];

int compar(const void* ptr1, const void* ptr2)
{
	int *num1=(int*)ptr1, *num2=(int*)ptr2;
	if(*num1>*num2)
		return 1;
	if(*num1<*num2)
		return -1;
	return 0;
}

int main()
{
	int T, N;
	int i;
	scanf("%d", &T);
	while(T--) {
		scanf("%d", &N);
		for(i=0;i<N;++i)
			scanf("%d", num+i);

		qsort(num, N, sizeof(int), compar);

		printf("%d", num[0]);
		for(i=1;i<N;i++)
			printf(" %d", num[i]);
		printf("\n");
	}
	return 0;
}</span>