| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 487676 | desmond_willow | Best Place (NOI17_bestplace) | C++17 | 100 ms | 1060 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 () {
uint n; cin >> n;
uint x[n], y[n];
for (uint i = 0; i < n; i++) cin >> x[i] >> y[i];
sort(x, x+n); sort(y, y+n);
if (n % 2 != 0) printf("%d %d\n", x[n/2], y[n/2]);
else printf ("%d %d\n", (x[(n/2)-1] + x[n/2])/2, (y[(n/2)-1] + y[n/2])/2);
}| # | 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... | ||||
