This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
//made by djsksbrbf
#include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> pii;
typedef long long ll;
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
ll n; cin >> n;
vector <int> xs, ys;
for(ll i = 0 ; i < n ; i++){
ll x, y; cin >> x >> y;
xs.push_back(x);
ys.push_back(y);
}
sort(xs.begin(), xs.end());
sort(ys.begin(), ys.end());
if(n % 2)cout << (xs[n / 2] + xs[n / 2 - 1]) / 2 << ' ' << (ys[n / 2] + ys[n / 2 - 1] / 2) << endl;
else cout << xs[n / 2] << ' ' << ys[n / 2] << endl;
return 0;
}
# | 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... |