Submission #742268

#TimeUsernameProblemLanguageResultExecution timeMemory
742268North1304Best Place (NOI17_bestplace)C++14
100 / 100
35 ms1116 KiB
#include <bits/stdc++.h> using namespace std; const int N = 2e5 + 1; int x[N] , y[N]; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); int n; cin >> n; for(int i=1;i<=n;i++) cin >> x[i] >> y[i]; sort(x+1, x+1+n); sort(y+1, y+1+n); cout << x[(n/2)+1] << ' ' << y[(n/2)+1]; 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...