Pair sort

#include <cstdio>
#include <iostream>
#include <utility>
#include <vector>

using namespace std;

int main(int argc, char *argv[])
{
	// Read the input parameters
	int n;
	cin >> n;

	// Read values from one line
    vector<int> occurence(n + 1, 0);
	vector<int> input_line(2*n);
	for (int i = 0; i < 2 * n; i++) {
        int tmp;
		cin >> tmp;
        if (occurence[tmp] == 0) {
            occurence[tmp] = i;
        }
        input_line[i] = tmp;
	}

    // int i = 0;
    // while (i < 2*n) {
    //     int tmp = input_line[i];
    //     if (tmp == input_line[i+1]) continue;
    //     else {

    //     }
    // }

    // for (int i = 0; i < 2 * n; i++) {
    //     
    // }

    vector<pair<int, int>> swaps;
    int swaps_amount = 0;
    for (int i = 2*n - 1; i > 1; i -= 2) {
        if (input_line[i] == input_line[i-1]) continue;
        else {
            int first_index = occurence[input_line[i-1]];
            // swap to match the pair
            swaps.push_back({i, first_index});
            swaps_amount++;
            // int tmp = input_line[i];
            input_line[first_index] = input_line[i];
            input_line[i] = input_line[i-1];
            // update the first location of i
            if (occurence[input_line[i]] > first_index) {
                occurence[input_line[i]] = first_index;
            }
        }
    }

    cout << swaps_amount << "\n";
    for (int i = 0; i < swaps_amount; i++) {
        cout << swaps[i].first << " " << swaps[i].second << "\n";
    }

	return 0;
}

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