제출 #493675

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
493675		AbstractGhoul05	Best Place (NOI17_bestplace)	C++14	100 / 100	122 ms	4084 KiB

bestplace

#include <bits/stdc++.h>

using namespace std;

int median(vector<int> x)
{
    if (x.size() % 2 == 0)
        return (x.at((x.size() / 2) - 1) + x.at(x.size() / 2)) / 2;
    else
        return x.at((x.size() - 1) / 2);
}

int main()
{
    int n{};
    cin >> n;
    vector<int> x, y;
    int xi{}, yi{};
    for (int i = 0; i < n; i++)
    {
        cin >> xi >> yi;
        x.push_back(xi);
        y.push_back(yi);
    }
    sort(x.begin(), x.end());
    sort(y.begin(), y.end());
    cout << median(x) << " " << median(y) << 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