# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
545345 | Trisanu_Das | Best Place (NOI17_bestplace) | C++17 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bit/stdc++.h>
using namespace std;
const int MAXN = 100000;
int N, X[MAXN], Y[MAXN];
int main(){
cin >> N;
for (int i = 0; i < N; ++i) {
cin >> X[i] >> Y[i];
}
sort(X, X+N);
cout << X[N/2] << " 0" << endl;
}