SwapSort
Time Limit:1000MS Memory Limit:262144KB 64bit IO Format:%I64d & %I64u
http://codeforces.com/problemset/problem/489/A
Description
In this problem your goal is to sort an array consisting of n integers in at most n swaps. For the given array find the sequence of swaps that makes the array sorted in the non-descending order. Swaps are performed consecutively, one after another.
Note that in this problem you do not have to minimize the number of swaps — your task is to find any sequence that is no longer than n.
Input
The first line of the input contains integer n (1 ≤ n ≤ 3000) — the number of array elements. The second line contains elements of array: a0, a1, …, an - 1 ( - 109 ≤ ai ≤ 109), where ai is the i-th element of the array. The elements are numerated from 0 to n - 1 from left to right. Some integers may appear in the array more than once.
Output
In the first line print k (0 ≤ k ≤ n) — the number of swaps. Next k lines must contain the descriptions of the k swaps, one per line. Each swap should be printed as a pair of integers i, j (0 ≤ i, j ≤ n - 1), representing the swap of elements ai and aj. You can print indices in the pairs in any order. The swaps are performed in the order they appear in the output, from the first to the last. It is allowed to print i = j and swap the same pair of elements multiple times.
If there are multiple answers, print any of them. It is guaranteed that at least one answer exists.
Sample Input
Input
5
5 2 5 1 4
Output
2
0 3
4 2
Input
6
10 20 20 40 60 60
Output
0
Input
2
101 100
Output
1
0 1
#include <iostream>
#include <cstdio>
#include <cstring>
#include <string>
#include <algorithm>
using namespace std;
int main()
{
int k,a[3000+10];
while(scanf("%d",&k)!=EOF)
{
for(int i=0;i<k;i++) cin>>a[i];
pair<int,int> p[3000+10];
int cnt=0;
for(int i=0;i<k;i++)
{
int un=i;
for(int j=i;j<k;j++)
if(a[j]<a[un])
un=j;
if(i!=un){
p[cnt].first = i;
p[cnt++].second = un;
}
swap(a[un],a[i]);
}
printf("%d\n",cnt);
for(int i=0;i<cnt;i++)
printf("%d %d\n",p[i].first,p[i].second);
}
return 0;
}