Pair sort

#include <bits/stdc++.h>

using namespace std;

#define debug(x) cerr << #x << ": " << x << endl;

void swap(int arr[], int i, int k) {
    int temp = arr[i];
    arr[i] = arr[k];
    arr[k] = temp;
}

int main() {
    int n;
    cin >> n;
    int arr[n];
    for (int i = 0; i < 2*n; i++)
    {
        cin >> arr[i];
    }

    int swaps = 0;
    
    for (int i = 0; i < 2*n-1; i++)
    {
        if (arr[i] == arr[i+1]) {
            continue;
        }

        for (int j = i+2; j < 2*n; j++)
        {
            if (arr[j] == arr[i+1]) {
                swap(arr, i, j);
                swaps++;
            }
        }
    }
    
    cout << swaps << endl;
    for (int i = 0; i < 2*n; i++)
    {
        cout << arr[i] << ' ';
    }
    cout << endl;
    

    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: RUNTIME ERROR

*** stack smashing detected ***: terminated

Test 8

Verdict: RUNTIME ERROR

*** stack smashing detected ***: terminated

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