Sicily 1154 Easy Sort(排序)

//簡單快速排序，原來在Sicily上用qsort要添加algorithm的，難怪校賽的時候用next_permutation出錯，原來是沒添加<algorithm>真是可惡！經驗不夠啊！！<br />//POJ跟Sicily 差別這麼大……<br />#include<iostream><br />#include<cstdio><br />#include<algorithm><br />using namespace std;<br />int arr[1000001];<br />int cmp_int(const void *a,const void *b)<br />{<br />int *A = (int*)a;<br />int *B = (int*)b;<br />return *A - *B;<br />}<br />int main()<br />{<br />int t,n;<br />scanf("%d",&t);<br />while(t--)<br />{<br />scanf("%d",&n);<br />for(int i = 0;i < n;++i)<br />{<br />scanf("%d",&arr[i]);<br />}<br />qsort(arr,n,sizeof(arr[0]),cmp_int);<br />for(int i = 0;i <n;++i)<br />{<br />printf("%d/n",arr[i]);<br />}<br />}<br />return 0;<br />}<br />