제출 #527518

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
527518		yashgupta7337	Best Place (NOI17_bestplace)	C++14	100 / 100	40 ms	3012 KiB

bestplace

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

void solve()
{
    int n;
    cin >> n;

    vector<int> x(n, 0), y(n, 0);
    for (int i = 0; i < n; i++)
    {
        int xi, yi;
        cin >> xi >> yi;
        x[i] = xi;
        y[i] = yi;
    }
    sort(x.begin(), x.end());
    sort(y.begin(), y.end());
    if (n % 2 == 0)
    {
        int ansx = (x[n / 2] + x[n / 2 - 1]) / 2;
        int ansy = (y[n / 2] + y[n / 2 - 1]) / 2;
        cout << ansx << " " << ansy << "\n";
    }
    else
    {
        int ansx = x[n / 2];
        int ansy = y[n / 2];
        cout << ansx << " " << ansy << "\n";
    }
}

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

    int t = 1;
    // cin >> t;
    while (t--)
    {
        solve();
    }
}
/* stuff you should look for
 * read the problem 3 more times in case of WA :)
 * int overflow, array bounds
 * special cases (n=1?)
 * do something instead of nothing and stay organized
 * WRITE STUFF DOWN
 * DON'T GET STUCK ON ONE APPROACH
 */

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