Tanssiaiset

#include <iostream>
#include <vector>

using namespace std;

int main()
{
    int n;
    cin >> n;
    int npairs = n / 2 + 1;
    vector<pair<int, int>> x;
    for(int i = 0; i < npairs; i++)
    {
        int a, b;
        cin >> a;
        cin >> b;
        x.push_back({a, b});
    }
    
    pair<int, int> g;
    
    for(int i = 0; i < npairs; i++)
    {
        int found = 0;
        pair<int, int> y = x[i];
        for(int j = i + 1; j < npairs; j++)
        {
            pair<int, int> z = x[j];
            if(y.first == z.first || y.second == z.second || y.first == z.second || y.second == z.first)
            {
                if(found == 1)
                {
                    cout << y.first << " " << y.second;
                    return 0;
                }
                g = z;
                found++;
            }
        }
        if(found == 1)
        {
            cout << g.first << " " << g.second;
            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: TIME LIMIT EXCEEDED

Test 9

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 10

Group: 2

Verdict: ACCEPTED