HDOJ 1040 As Easy As A+B
水题。
附ac代码:
#include <stdio.h> #include <stdlib.h> int cmp(const void *a, const void *b){ return *(int *)a - *(int *)b; } int main(){ int n, *a, i, t; scanf("%d", &t); while(t-- && scanf("%d", &n)){ i = n; a = (int *)malloc(sizeof(int) *n); while(i--) scanf("%d", &a[i]); qsort(a, n, sizeof(int), cmp); for(i = 0; i != n - 1; ++i) printf("%d ", a[i]); printf("%d\n", a[i]); free(a); } return 0; }