# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
471360 | grimzzz404 | Best Place (NOI17_bestplace) | C++17 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
/**
* Author: grimzzz404
**/
#include <bits/stdc++.h>
using namespace std;
#define endl '\n'
void solve();
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
int t = 1;
//cin >> t;
FOR(t)
{
//cout << "Test Case #" << i + 1 << '\n';
solve();
}
return 0;
}
void solve()
{
int n;
cin >> n;
int one[n];
int two[n];
for (int i = 0; i < n; i++)
{
cin >> one[i] >> two[i];
}
sort(one,one+n);
sort(two,two+n);
int c = n/2;
cout << one[c] << " " << two[c];
}