제출 #742272

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
742272		Fnzx	Best Place (NOI17_bestplace)	C++17	3 / 100	39 ms	1316 KiB

bestplace

#include<bits/stdc++.h>

using namespace std;

using pii = pair<int,int> ;

const int N = 1e5+5;
const int MOD = 1e9+7 ;

int n , ans;

vector<int> X , Y ;

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

    cin >> n ;
    for(int i=1;i<=n;i++){
        int y , x ; cin >> x >> y ;
        Y.push_back(y) , X.push_back(x) ;
    }
    sort(X.begin() , X.end()) ;
    sort(Y.begin() , Y.end()) ;

    if(n % 2){
        cout << X[(n+1)/2] << " " << Y[(n+1)/2] ;
    }
    else {
        cout << X[n / 2] << " " << Y[n / 2] ;
    }
}

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