Submission #559695

#	Time	Username	Problem	Language	Result	Execution time	Memory
559695		Garguy22	Best Place (NOI17_bestplace)	C++17	100 / 100	108 ms	3024 KiB

bestplace

#include <iostream>
#include <algorithm>
using namespace std;

const int MAXN = 1e5 + 7;

int x[MAXN], y[MAXN];

int main(){

	int n;
	cin >> n;
	for(int i = 0; i < n; i++) cin >> x[i] >> y[i];
	sort(x, x + n);
	sort(y, y + n);
	cout << x[n/2] << " " << y[n/2] << endl;

}

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