Submission #486623

#TimeUsernameProblemLanguageResultExecution timeMemory
486623devomega07Best Place (NOI17_bestplace)C++14
100 / 100
101 ms3880 KiB
#include <bits/stdc++.h> using namespace std; using l=long long; int main() { l n; cin >> n; vector<l> 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[ceil(n/2)] << " " << y[ceil(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...