Submission #741599

#	Time	Username	Problem	Language	Result	Execution time	Memory
741599		Joo	Best Place (NOI17_bestplace)	C++17	100 / 100	37 ms	3144 KiB

bestplace

// Task: https://oj.uz/problem/view/NOI17_bestplace
// Algo: Median
// Date: 14/5/2023

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

int main()
{
    cin.tie(0)->sync_with_stdio(0);
    int n;
    cin >> n;
    vector<int> xPos(n), yPos(n);
    for (int i = 0; i < n; i++)
        cin >> xPos[i] >> yPos[i];

    sort(xPos.begin(), xPos.end());
    sort(yPos.begin(), yPos.end());

    cout << xPos[n / 2] << " " << yPos[n / 2] << "\n";
}

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