This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
vector<pair<int,int>> posi(n+1);
for(int i=1;i<=n;i++){
cin>>posi[i].first>>posi[i].second;
}
sort(posi.begin(),posi.end());
if(n%2==0){
cout<<(posi[n/2].first+posi[n/2+1].first)/2<<' '<<0;
}else cout<<(posi[n/2+1].first)<<' '<<0;
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |