Pair sort

def pairsort(n, numbers):
    i = 0
    swaps = 0
    switches = []
    length = n * 2
    while i < length - 1:
        if swaps > (n - 1):
            print("failed")
            break
        if numbers[i] == numbers[i+1]:
            i += 2
            continue
        if numbers[i] != numbers[i+1]:
            for j in range(i+2, length):
                if numbers[j] == numbers[i]:
                    a = numbers[j]
                    b = numbers[i+1]
                    numbers[i+1] = a
                    numbers[j] = b
                    swaps += 1
                    switches.append((i+2, j+1))
                    i += 2
                    break
    return swaps, switches

if __name__ == "__main__":
    n = int(input())
    m = list(map(int, input().split()))
    swap_count, sorted = pairsort(n, m)
    print(swap_count)
    for i in sorted:
        print(*i)

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