Merkkijono

#include <iostream>
#include <utility>

using namespace std;

#define N 100001
int p[N];
pair<int, int> inp[N];

int main() {
	ios_base::sync_with_stdio(0); cin.tie(0);
	int n; cin >> n; cin.ignore();
	int k = (n / 2) + 1;
	
	for (int i = 0; i < k; i++) {
		int a, b; cin >> a >> b; cin.ignore();
		p[a]++;
		p[b]++;
		inp[i] = make_pair(a, b);
	}
	
	for (int i = 0; i < k; i++) {
		pair<int,int> L = inp[i];
		int a = L.first,b=L.second;
		p[a]--; p[b]--;
		if (p[a] == 1 || p[b] == 1) {
			cout << a <<" " << b;
			break;
		}
	}
	
	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