Submission #966058

#TimeUsernameProblemLanguageResultExecution timeMemory
966058Zone_zoneeBest Place (NOI17_bestplace)C++14
0 / 100
60 ms1364 KiB
#include <bits/stdc++.h> using namespace std; int main(){ int n; cin>>n; vector<pair<int,int>> posi(n); for(int i=1;i<=n;i++){ cin>>posi[i].first>>posi[i].second; } sort(posi.begin(),posi.end()); cout<<posi[n/2].first<<' '<<0; 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...