Submission #966008

#TimeUsernameProblemLanguageResultExecution timeMemory
966008Zone_zoneeBest Place (NOI17_bestplace)C++14
48 / 100
79 ms2376 KiB
#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 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...