Tanssiaiset

#include <iostream>
#include <map>

using namespace std;

int main() {
    int n;
    cin >> n;
    int* m = new int[n + 2];
    pair<int, int>* d = new pair<int, int>[n / 2 + 2];
    int c[4] = {0};
    int cc = 0;
    for (int i = 1; i <= n / 2 + 1; i++) {
        int a, b;
        cin >> a >> b;
        d[i] = make_pair(a, b);
        if (m[a]) {
            c[cc++] = m[a];
            c[cc++] = i;
        } 
        if (m[b]) {
            c[cc++] = m[b];
            c[cc++] = i;
        }
        if (cc == 4) break;
        m[a] = i; m[b] = i;
    }
    for (int i = 0; i < 3; i++) {
        for (int j = i + 1; j < 4; j++) {
            if (c[i] == c[j]) {
                cout << d[c[i]].first << " " << d[c[i]].second << endl;
                return 0;
            }
        }
    }
}

Test 1

Group: 1

Verdict: ACCEPTED

Test 2

Group: 1

Verdict: ACCEPTED

Test 3

Group: 1

Verdict: ACCEPTED

Test 4

Group: 1

Verdict: ACCEPTED

Test 5

Group: 1

Verdict: ACCEPTED

Test 6

Group: 2

Verdict: ACCEPTED

Test 7

Group: 2

Verdict: ACCEPTED

Test 8

Group: 2

Verdict: ACCEPTED

Test 9

Group: 2

Verdict: ACCEPTED

Test 10

Group: 2

Verdict: ACCEPTED