Submission #1330415

#TimeUsernameProblemLanguageResultExecution timeMemory
1330415edoBest Place (NOI17_bestplace)C++20
100 / 100
26 ms1212 KiB
#include <bits/stdc++.h>

using namespace std;
using ll = long long;


int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int n;
    cin >> n;
    int x[n], y[n];
    for (int i = 0; i < n; ++i) {
        cin >> x[i] >> y[i];
    }

    sort(x, x + n);
    sort(y, y + n);

    if(n & 1) {
        cout << x[n >> 1] << " " << y[n >> 1];
    }
    else {
        cout << min(x[n >> 1], x[(n + 1) >> 1]) << " " << min(y[n >> 1], y[(n + 1) >> 1]);
    }

    return 0;
}

#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...