This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#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 time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |