| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 966044 | JungPS | 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<iostream>
#include<cmath>
using namespace std;
#define int long long
int main(){
ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr);
int n; cin >> n;
int x[n],y[n];
for(int i=0;i<n;++i) cin >> x[i] >> y[i];
int minx=1e9,maxx=-1e9,miny=1e9,maxy=-1e9;
for(int i=0;i<n;++i){
minx=min(minx,x[i]);
maxx=max(maxx,x[i]);
miny=min(miny,y[i]);
maxy=max(maxy,y[i]);
}
cout << (minx+maxx)/2 << " " << (miny+maxy)/2;
}