Codeforces Round #277.5 (Div. 2)A. SwapSort

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 ij (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 test(s)
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 <stdio.h>
#include <algorithm>
using namespace std;
long long a[3005];
int X[3005],Y[3005];
int main()
{
    int n;
    while (scanf("%d",&n)!=EOF)
    {
        for (int i=0; i<n; i++)
        {
            scanf("%lld",&a[i]);
        }
        int ans=0,cnt=0;
        for (int i=0; i<n; i++)
        {
            long long Max=10000000000000;
            int k=-1,j;
            for (j=i; j<n; j++)
            {
                if(Max>a[j])
                {
                    Max=a[j];
                    k=j;
                }
            }
            if(i!=k)
            {
                swap(a[i],a[k]);
                X[cnt]=i;
                Y[cnt++]=k;
                ans++;
                
            }
        }
        printf("%d\n",ans);
        for (int i=0; i<cnt; i++)
        {
            printf("%d %d\n",X[i],Y[i]);
        }
    }
    return 0;
}



  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值