Submission #485431

#TimeUsernameProblemLanguageResultExecution timeMemory
485431blueBest Place (NOI17_bestplace)C++17
100 / 100
108 ms3000 KiB
#include <iostream> #include <vector> #include <algorithm> 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()); cout << x[N/2] << ' ' << y[N/2] << '\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...