# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
494281 | CjSidharth | Best Place (NOI17_bestplace) | C++14 | 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.
#include<bits/stdc++.h>
#define REP(i,a,b) for(int i = a; i < b;i++)
typedef long long int ll;
using namespace std;
int main()
{
ll n,x1,y1; cin >> n;
vector<ll> x(n), y(n);
REP(i,0,n)
{
cin >> x1 >> y1;
x.push_back(x1);y.push_back(y1);
}
sort(x.begin(),x.end());
sort(y.begin(),y.end());
cout<<x[n/2]<<" "<<y[n/2];
return 0;