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 <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector <int> x(n), y(n);
for (int i = 0; i < n; i++)
cin >> x[i] >> y[i];
sort(x.begin(), x.end());
sort(y.begin(), y.end());
int ansx, ansy;
if (n % 2 == 1) {
ansx = x[n / 2];
ansy = y[n / 2];
} else {
ansx = (x[n / 2 - 1] + x[n / 2]) / 2;
ansy = (y[n / 2 - 1] + y[n / 2]) / 2;
}
cout << ansx << ' ' << ansy << '\n';
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |