Sicily 1154 easy sort (SORT)

// Simple and fast sorting. It turns out that algorithm was added with qsort on Sicily. It's no wonder that an error occurred while using next_permutation during the school competition. It turns out that <algorithm> was not added! Not experienced enough !! <Br/> // The difference between poj and 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/> return 0; <br/>}< br/>