Submission #1324884

#	Time	Username	Problem	Language	Result	Execution time	Memory
1324884		m0rtu_us0512	Best Place (NOI17_bestplace)	C++17	100 / 100	26 ms	1996 KiB

bestplace

// https://oj.uz/problem/view/NOI17_bestplace

#include<bits/stdc++.h>
using namespace std;

struct Solver{
    int64_t N;
    vector<int64_t> x;
    vector<int64_t> y;

    void init(){
        x.resize(N);
        y.resize(N);

        for ( int64_t n=0 ; n<N ; n++ )
            cin >> x[n] >> y[n];
    }

    tuple<int64_t, int64_t> solve(){
        sort(x.begin(),x.end());
        sort(y.begin(),y.end());

        return {x[N/2], y[N/2]} ;
    }
};

int main(){
    ios_base::sync_with_stdio(0) ;
    cin.tie(0) ;

    Solver p;

    cin >> p.N ;
    p.init();

    auto [x,y] = p.solve();
    cout << x << " " << y << endl ;
    //cout<<p.xmedian()<<" "<<p.ymedian()<<endl;
    return 0;
}

• Subtask 1: 3 / 3
• Subtask 2: 20 / 20
• Subtask 3: 28 / 28
• Subtask 4: 13 / 13
• Subtask 5: 17 / 17
• Subtask 6: 19 / 19