Pair sort

def main():
    n = int(input())
    arr = list(map(int, input().split()))

    count = 0
    result = []

    for i in range(n):
        firstPos = 2 * i
        secondPos = 2 * i + 1
        prev_num = arr[firstPos]
        curr_num = arr[secondPos]
        if prev_num == curr_num:
            continue
        for j in range(secondPos + 1, 2 * n):
            if arr[j] == curr_num:
                count += 1
                result.append([firstPos + 1, j + 1])
                arr[firstPos], arr[j] = arr[j], arr[firstPos]
        
    print(count)
    for pair in result:
        print(" ".join(map(str, pair)))

    
    



if __name__ == "__main__":
    main()

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED

Test 3

Verdict: ACCEPTED

Test 4

Verdict: ACCEPTED

Test 5

Verdict: ACCEPTED

Test 6

Verdict: ACCEPTED

Test 7

Verdict: ACCEPTED

Test 8

Verdict: ACCEPTED

Test 9

Verdict: ACCEPTED

Test 10

Verdict: ACCEPTED

Test 11

Verdict: ACCEPTED

Test 12

Verdict: ACCEPTED

Test 13

Verdict: ACCEPTED

Test 14

Verdict: ACCEPTED