제출 #527514

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

bestplace

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

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

    int minY = INT_MAX, maxY = INT_MIN, minX = INT_MAX, maxX = INT_MIN;
    for (int i = 0; i < n; i++)
    {
        int x, y;
        cin >> x >> y;
        minY = min(minY, y);
        maxY = max(maxY, y);
        minX = min(minX, x);
        maxX = max(maxX, x);
    }
    cout << (maxX + minX) / 2 << " " << (maxY + minY) / 2 << "\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: 0 / 20
• Subtask 3: 0 / 28
• Subtask 4: 0 / 13
• Subtask 5: 0 / 17
• Subtask 6: 0 / 19