Submission #1015478

#TimeUsernameProblemLanguageResultExecution timeMemory
1015478overwatch9Best Place (NOI17_bestplace)C++17
100 / 100
58 ms3408 KiB
#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 timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...