Pair sort

#![allow(unused)]

use std::{io, thread::spawn};

fn take_int() -> usize {
    let mut input = String::new();
    io::stdin().read_line(&mut input).unwrap();
    return input.trim().parse::<usize>().unwrap();
}

fn take_vector() -> Vec<(usize, usize)> {
    let mut input = String::new();
    io::stdin().read_line(&mut input).unwrap();
    let arr: Vec<(usize, usize)> = input
        .trim()
        .split_whitespace()
        .map(|x| x.parse::<usize>().unwrap())
        .enumerate()
        .collect();
    return arr;
}

fn main() {
    let mut n: usize = take_int();
    let mut arr: Vec<(usize, usize)> = take_vector();
    let mut sorted = arr.clone();

    sorted.sort_by_key(|k| k.1);
    // println!("{:?}", arr);
    // println!("{:?}", sorted);
    // println!("");

    let mut i = 0;
    let mut count_swaps = 0;
    let mut swaps: Vec<(usize, usize)> = Vec::with_capacity(n);
    while i < n {
        let current = arr[i];
        if arr[i + 1].1 != current.1 {
            count_swaps += 1;
            let index = sorted[current.0 * 2 + 1].0;
            // println!("index to change {}", index);

            swaps.push((i + 1, index));

            let temp = arr[index];

            sorted[index].0 = index;

            arr[index] = arr[i + 1];
            arr[i + 1] = temp;
            sorted[i + 1].0 = i+1;

        }
        // println!("{:?}", arr);
        // println!("{:?}", sorted);
        // println!("");
        i += 2;
    }
    println!("{}", count_swaps);
    for i in 0..swaps.len() {
        println!("{} {}", swaps[i].0, swaps[i].1);
    }
}

Test 1

Verdict: WRONG ANSWER

Test 2

Verdict: WRONG ANSWER

Test 3

Verdict: WRONG ANSWER

Test 4

Verdict: WRONG ANSWER

Test 5

Verdict: WRONG ANSWER

Test 6

Verdict: WRONG ANSWER

Test 7

Verdict: WRONG ANSWER

Test 8

Verdict: WRONG ANSWER

Test 9

Verdict: WRONG ANSWER

Test 10

Verdict: WRONG ANSWER

Test 11

Verdict: WRONG ANSWER

Test 12

Verdict: WRONG ANSWER

Test 13

Verdict: WRONG ANSWER

Test 14

Verdict: WRONG ANSWER