Submission #1324868

#	Time	Username	Problem	Language	Result	Execution time	Memory
1324868		wyn	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 participants{
    int64_t N;
    vector<int64_t> x;
    vector<int64_t> y;

    void resize(){
        x.resize(N);
        y.resize(N);
    }
    int xmedian(){
        return x[x.size()/2];
    }
    int ymedian(){
        return y[y.size()/2];
    }
};

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

    participants p;

    cin >> p.N ;
    p.resize();
    for ( int n=0 ; n<p.N ; n++ )
        cin >> p.x[n] >> p.y[n];
    sort(p.x.begin(),p.x.end());
    sort(p.y.begin(),p.y.end());
    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