Submission #507561

#	Time	Username	Problem	Language	Result	Execution time	Memory
507561		th111	Best Place (NOI17_bestplace)	C++14	100 / 100	107 ms	2980 KiB

bestplace

#include <bits/stdc++.h>
 
using namespace std;
 
int main()
{
	int N;
	cin >> N;
	int x[N];
	int y[N];
	for (int i = 0; i < N; i++)
	{
		cin >> x[i];
		cin >> y[i];
	}
 
	sort(x, x + N);
	sort(y, y + N);
 
	int minx;
	int miny;
 
	if (N % 2 == 0)
	{
		minx = (x[N / 2 - 1] + x[(N + 1) / 2 - 1]) / 2;
		miny = (y[N / 2 - 1] + y[(N + 1) / 2 - 1]) / 2;
	}
	else
	{
		minx = x[N / 2];
		miny = y[N / 2];
	}
 
	cout << minx << " " << miny << "\n";
 
	return 0;
}

• Subtask 1: 3 / 3
• Subtask 2: 20 / 20
• Subtask 3: 28 / 28
• Subtask 4: 13 / 13
• Subtask 5: 17 / 17
• Subtask 6: 19 / 19