# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
209543 | model_code | Best Place (NOI17_bestplace) | C++17 | 81 ms | 3308 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 <bits/stdc++.h>
using namespace std;
int main() {
int n; scanf("%d", &n);
vector<int> x, y;
for(int i = 0; i < n; i++) {
int a, b; scanf("%d%d", &a, &b);
x.push_back(a);
y.push_back(b);
}
sort(x.begin(), x.end());
sort(y.begin(), y.end());
if(n % 2 == 1) {
printf("%d %d\n", x[n / 2], y[n / 2]);
}else {
printf("%d %d\n", (x[n / 2] + x[n / 2 - 1]) / 2, (y[n / 2] + y[n / 2 - 1]) / 2);
}
return 0;
}
Compilation message (stderr)
# | 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... |