Submission #782932

#TimeUsernameProblemLanguageResultExecution timeMemory
782932PetrixBest Place (NOI17_bestplace)C++17
100 / 100
85 ms3780 KiB
#include <iostream> #include <algorithm> using namespace std; long long a[100001],b[100001]; int main() { long long n,i; cin>>n; for(i=0;i<n;i++){ cin>>a[i]>>b[i]; } sort(a,a+n);sort(b,b+n); cout<<a[n/2]<<" "<<b[n/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...