| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1307153 | yumemystery | Best Place (NOI17_bestplace) | C++20 | 73 ms | 4004 KiB |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int>x(n+1,0);
vector<int>y(n+1,0);
for (int i=1; i<=n; i++) cin >> x[i] >> y[i];
sort(x.begin(),x.end());
sort(y.begin(),y.end());
if (n % 2 == 0) cout << (x[n/2]+x[n/2 + 1])/2 << " " << (y[n/2]+y[n/2 + 1])/2;
else cout << x[n/2+1] << " " << y[n/2+1];
}| # | 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... | ||||
