Submission #545351

#TimeUsernameProblemLanguageResultExecution timeMemory
545351Trisanu_DasBest Place (NOI17_bestplace)C++17
100 / 100
96 ms3024 KiB
#include <bits/stdc++.h> using namespace std; const int MAXN = 100000; int N, X[MAXN], Y[MAXN]; int main(){ cin >> N; for (int i = 0; i < N; ++i) { cin >> X[i] >> Y[i]; } sort(X, X+N); sort(Y, Y+N); cout << X[N/2] << " " << Y[N/2] << endl; }
#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...