Submission #522629

#TimeUsernameProblemLanguageResultExecution timeMemory
522629lucriBest Place (NOI17_bestplace)C++17
100 / 100
117 ms3776 KiB
#include <iostream> #include <algorithm> using namespace std; long long n,x[100010],y[100010]; int main() { cin>>n; for(int i=1;i<=n;++i) { cin>>x[i]>>y[i]; } sort(x+1,x+n+1); sort(y+1,y+n+1); cout<<x[(n+1)/2]<<' '<<y[(n+1)/2]; 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...