Submission #872916

#TimeUsernameProblemLanguageResultExecution timeMemory
872916vjudge1Best Place (NOI17_bestplace)C++17
100 / 100
81 ms1184 KiB
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

int N;
int x[100005];
int y[100005];

int main () {
	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];
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...