제출 #1148587

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1148587		THXuan	Best Place (NOI17_bestplace)	C++20	100 / 100	23 ms	1864 KiB

bestplace

#include <iostream>
#include <vector>
#include <algorithm>
#include <stack>
#include <queue>
#include <map>
#include <set>
#define INF 1e9
using namespace std;
typedef long long ll;
const ll MOD = 1e9 + 7;

void solve()
{
    int n; cin >> n;
    vector<ll>x(n), y(n);
    for (int i = 0; i < n; i++)cin >> x[i] >> y[i];
    sort(x.begin(), x.end());
    sort(y.begin(), y.end());
    cout << x[n / 2] << " " << y[n / 2] << "\n";
}

int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    int t = 1; //cin >> t;
    while (t--) 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