Tanssiaiset

/*
 * tanssiaiset.cpp
 *
 *  Created on: Jan 18, 2018
 *      Author: guest410
 */

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

using namespace std;

//typedef unsigned int uint;

int main() {
	uint n;
	cin >> n;
	n = n/2 + 1;
	vector<pair<uint, uint>> pairs;
	for (uint i = 0; i < n; i++) {
		uint n1, n2;
		cin >> n1 >> n2;
		pairs.push_back(make_pair(n1, n2));
	}
	sort(pairs.begin(), pairs.end());
//	for (unsigned int i = 0; i < n; i++) {
//		cout << pairs[i].first << ' ' << pairs[i].second << '\n';
//	}
	uint prev = 0;
	auto it = pairs.begin();
	for (; /*it != pairs.end()*/; ++it) {
		if (it->first == prev) {
			--it;
			break;
		}
		prev = it->first;
	}
	uint anot = it->second, lukum = 0;
	for (auto it2 = pairs.begin(); it2 != pairs.end(); it2++) {
//		if (it2->first == anot || it2->second == anot) ++lukum;
		lukum += (it2->first == anot) + (it2->second == anot);
	}
	if (lukum > 1) {
		cout << prev << ' ' << anot << '\n';
	} else {
		++it;
		cout << it->first << ' ' << it->second << '\n';
	}

	return 0;
}

Test 1

Group: 1

Verdict: ACCEPTED

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: ACCEPTED

Test 9

Group: 2

Verdict: WRONG ANSWER

Test 10

Group: 2

Verdict: WRONG ANSWER