Submission #1342277

#	Time	Username	Problem	Language	Result	Execution time	Memory
1342277		mantaggez	Best Place (NOI17_bestplace)	C++20	100 / 100	27 ms	2600 KiB

bestplace

#include <bits/stdc++.h>

using namespace std;
using ll = long long;

struct point {
    ll x, y;
};

ll n;
vector<point> p;

ll dist(point& a, point& b) { return abs(a.x - b.x) + abs(a.y - b.y); }

int main()
{
    cin.tie(NULL)->sync_with_stdio(false);
    cin >> n;
    for(ll i=0;i<n;i++) {
        ll x, y;
        cin >> x >> y;
        p.push_back({x, y});
    }

    point ans;
    sort(p.begin(), p.end(), [&](point& a, point& b) {
        return a.x < b.x;
    });
    ans.x = p[n / 2].x;

    sort(p.begin(), p.end(), [&](point& a, point& b) {
        return a.y < b.y;
    });
    ans.y = p[n / 2].y;

    cout << ans.x << ' ' << ans.y << '\n'; 

    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