Submission #1006024

#TimeUsernameProblemLanguageResultExecution timeMemory
1006024devariaotaBest Place (NOI17_bestplace)C++17
100 / 100
63 ms2132 KiB
#include <bits/stdc++.h>
#define ll long long
#define endl '\n'
using namespace std;

const ll INF = 1e15;
const ll MOD = 1e9 + 7;

void solve()
{
    ll n;
    cin >> n;
    ll 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 % 2 == 0)
    {
        cout << (x[n / 2 - 1] + x[n / 2]) / 2 << " " << (y[n / 2 - 1] + y[n / 2]) / 2 << endl;
    }
    else
    {
        cout << x[n / 2] << ' ' << y[n / 2] << endl;
    }
}

int main()
{
    ll tc;
    tc = 1;
    while (tc--)
    {
        solve();
    }
}
#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...