POJ 2388 Who’s in the Middle(排序)

//快排水題，練習STL的QSORT<br />#include<iostream><br />using namespace std;<br />int arr[10010];<br />int cmp(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 n;<br />cin >> n;<br />for(int i = 0;i < n;++i)<br />cin >> arr[i];<br />qsort(arr,n,sizeof(arr[0]),cmp);<br />cout << arr[n/2] << endl;<br />return 0;<br />}