Codeforces Round #277.5 (Div. 2), problem: (A) SwapSort

每次抓小的

#include<cstdio>
#include<cstdlib>
#include<algorithm>
#include<cstring>
#include<vector>
#include<utility>
#include<map>
#include<set>
#include<queue>
#include<cmath>
using namespace std;
typedef long long int int64;

int main()
{
    int n; int arr[3000];
    scanf("%d", &n);
    for(int lx = 0;lx < n;lx++)
        scanf("%d", arr+lx);
    printf("%d\n", n);
    for(int lx = 0;lx < n;lx++){
        int min_index = lx;
        for(int ly = lx+1;ly < n;ly++)
            if(arr[min_index] > arr[ly])
                min_index = ly;
        printf("%d %d\n", lx, min_index);
        swap(arr[lx], arr[min_index]);
    }
    return 0;
}