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++)
using namespace std;
int main()
{
int n,mx,my; cin >> n;
vector<int> x(n), y(n);
REP(i,0,n)
{
cin >> x[i] >> y[n];
}
sort(x.begin(),x.end());
sort(y.begin(),y.end());
if(n %2 == 0)
{
mx = x[n/2];
my = y[n/2];
}
else
{
mx = (x[(n-1)/2] + x[(n+1)/2])/2;
my = (y[(n-1)/2] + y[(n+1)/2])/2;
}
cout << mx<< " " << my;
}
# | 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... |