HDU 1040 排序 大水题一道

/*

 * Author:lonelycather

 * problem:hdu 1040

 * Type:简单排序

 */

#include<stdio.h>

#include <iostream>

#include<algorithm>

using namespace std; int cmp(const void* a,const void* b) { return *(int*)a-*(int*)b; } int N; int sequence[1000]; int main() { int T,i;

    cin>>T; while(T--) {

        cin>>N; for(i=0;i<N;i++) {

            scanf("%d",&sequence[i]); }

        qsort(sequence,N,sizeof(sequence[0]),cmp); for(i=0;i<N-1;i++) {

          printf("%d ",sequence[i]); }

        printf("%d\n",sequence[N-1]); } return 0; }