Submission #1327476

#TimeUsernameProblemLanguageResultExecution timeMemory
1327476gdshirpelengBest Place (NOI17_bestplace)C++20
100 / 100
72 ms2056 KiB
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
#define in insert
#define pb push_back

void solve(){
    ll n;
    cin>>n;
    vector<ll>xv;
    vector<ll>yv;
    ll x,y;
    for(int i=1;i<=n;i++){
        cin>>x>>y;
        xv.pb(x);
        yv.pb(y);
    }
    sort(xv.begin(),xv.end());
    sort(yv.begin(),yv.end());
    ll sum=0;
    ll coorx=xv[n/2],coory=yv[n/2];
    cout<<coorx<<" "<<coory;
}

int main(){
    solve();
    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...