제출 #968194

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
968194		Vladth11	Best Place (NOI17_bestplace)	C++14	100 / 100	35 ms	3388 KiB

bestplace

#include <bits/stdc++.h>
#define debug(x) cerr << #x << " " << x << "\n"
#define debugs(x) cerr << #x << " " << x << " "
#pragma GCC optimize ("Ofast")
#pragma GCC target ("avx2")

using namespace std;
typedef long long ll;
typedef pair <ll, ll> pii;

const ll NMAX = 100005;
const ll INF = 1e9;
const ll nrbits = 20;
const ll MOD = 998244353;

int x[NMAX];
int y[NMAX];

signed main() {
#ifdef HOME
    ifstream cin(".in");
    ofstream cout(".out");
#endif // HOME
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int i, n;
    cin >> n;
    for(i = 1;  i<= n; i++){
        cin >> x[i] >> y[i];
    }
    sort(x + 1, x + n + 1);
    sort(y + 1, y + n + 1);
    cout << x[(n + 1) / 2] << " " << y[(n + 1) / 2];
    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