Tanssiaiset

#include <iostream>
#include <vector>
#include <utility>
#include <algorithm>
#include <unordered_set>

using namespace std;

int main() {
	
	int n;
	cin >> n;

	unordered_multiset<int> left;
	unordered_multiset<int> right;

	for (int i = 0; i < (n/2) + 1; i++) {
		int a;
		int b;
		cin >> a;
		cin >> b;

		left.insert(a);
		right.insert(b);
	}


	int a = -1;
	int b = -1;

	for (int i = 1; i <= n; i++) {
		int c = 0;

		int leftc = left.count(i);
		int rightc = right.count(i);
		c += leftc;
		c += rightc;

		

		




		if (c == 2) {
			cout << i << ": " << endl;
			cout << leftc << endl;
			cout << rightc << endl;
			cout << c << endl;
			cout << "" << endl;

			if (a == -1)
				a = i;

			if (leftc == 2) {
				if (a != -1)
				b = a;
				a = i;
				break;
			}
			if (rightc == 2) {
				if (a != -1)
				a = b;
				b = i;
				break;
			}
		}
	}

	cout << a << " " << b << endl;
	return 0;
}

Test 1

Group: 1

Verdict: WRONG ANSWER

Test 2

Group: 1

Verdict: WRONG ANSWER

Test 3

Group: 1

Verdict: WRONG ANSWER

Test 4

Group: 1

Verdict: WRONG ANSWER

Test 5

Group: 1

Verdict: WRONG ANSWER

Test 6

Group: 2

Verdict: WRONG ANSWER

Test 7

Group: 2

Verdict: WRONG ANSWER

Test 8

Group: 2

Verdict: WRONG ANSWER

Test 9

Group: 2

Verdict: WRONG ANSWER

Test 10

Group: 2

Verdict: WRONG ANSWER