Submission #924930

#	Time	Username	Problem	Language	Result	Execution time	Memory
924930		notalonebro	Best Place (NOI17_bestplace)	C++14	100 / 100	31 ms	4748 KiB

bestplace

#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;
using ll = long long;

ll median(vector<ll> nums) {
    sort(nums.begin(), nums.end());
    ll n = nums.size();
    if (n % 2 != 0) {
        return nums[n / 2];
    } else {
        return (nums[(n - 1) / 2] + nums[n / 2]) / 2; // Keep as integer division for your case
    }
}

void solve() {
    ll n;
    cin >> n;
    vector<ll> x, y;
    x.reserve(n); 
    y.reserve(n);

    for (ll i = 0; i < n; i++) {
        ll a, b;
        cin >> a >> b;
        x.push_back(a);
        y.push_back(b);
    }

    ll medx = median(x);cout<<medx<<" ";
    ll medy = median(y);cout<<medy;

}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);

    solve();

    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