제출 #491494

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
491494		Ghost_in_the_Wire	Best Place (NOI17_bestplace)	C++17	100 / 100	35 ms	4068 KiB

bestplace

#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef vector<long long> vi;

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);

    ll n;
    cin >> n;
    vi posx = {};
    vi posy = {};
    for (int i = 0; i < n; i++) {
        ll temp1, temp2;
        cin >> temp1 >> temp2;
        posx.push_back(temp1);
        posy.push_back(temp2);
    }
    sort(posx.begin(), posx.end());
    sort(posy.begin(), posy.end());
    if (n%2==0) cout << posx[n/2] << " " << posy[n/2] << endl;
    else cout << posx[(n-1)/2] << " " << posy[(n-1)/2] << endl;
}

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