Cf489_a_ Insert Sort

Title Link: Http://codeforces.com/problemset/problem/489/A

AC Code:

1#include <cstdio>2#include <iostream>3#include <cstring>4#include <cstdlib>5#include <algorithm>6 using namespacestd;7 8 Const intMAXN = the+Ten;9 intA[MAXN], L[MAXN], R[MAXN];Ten intMain () { One     //freopen ("Test.txt", "R", stdin); A     intN; -      while(SCANF ("%d", &n)! =EOF) { -         intAns =0; the          for(intI=0; i<n; i++) -scanf"%d", &a[i]); -          for(intI=0; i<n; i++) { -             intK = Min_element (A+i, A+n)-A;//find the subscript for the smallest element inside [A+i, A+n] +             if(i!=k) { - swap (A[i], a[k]); +L[ans] = i; R[ans] = k; ans++; A             } at         } -printf"%d\n", ans); -          for(intI=0; i<ans; i++) { -printf"%d%d\n", L[i], r[i]); -         } -     } in     return 0; -}

View Code

The STL is a good thing to read someone else's writing ...

Cf489_a_ Insert Sort