Submission #487349

#TimeUsernameProblemLanguageResultExecution timeMemory
487349devomega07Best Place (NOI17_bestplace)C++14
100 / 100
84 ms3792 KiB
#include <bits/stdc++.h> using namespace std; using l = long long; int main() { l n; cin >> n; vector<l> f(n), s(n); for(int i=0; i<n; ++i){ cin >> f[i] >> s[i]; } sort(f.begin(),f.end()); sort(s.begin(),s.end()); cout << f[n/2] << " " << s[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...