Submission #715763

#TimeUsernameProblemLanguageResultExecution timeMemory
715763MilosMilutinovicBest Place (NOI17_bestplace)C++14
100 / 100
40 ms3064 KiB
#include <bits/stdc++.h> using i64 = long long; int main() { std::ios::sync_with_stdio(false); std::cin.tie(nullptr); int n; std::cin >> n; std::vector<int> x(n), y(n); for (int i = 0; i < n; i++) { std::cin >> x[i] >> y[i]; } std::sort(x.begin(), x.end()); std::sort(y.begin(), y.end()); std::cout << x[n / 2] << " " << y[n / 2] << "\n"; return 0; }
#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...