Manhattan sightseeing

#include<bits/stdc++.h>
//#include<unordered_set>
#pragma GCC optimize("Ofast")
using namespace std;
#define int long long
#define die(x) return cout << x << endl, 0
#define FI first
#define SE second
#define all(o) o.begin(), o.end()
#define endl '\n'
#define IOS ios::sync_with_stdio(0), cin.tie(0)
#define FILE freopen("input.txt", "r", stdin), freopen("output.txt", "w", stdout)
#define SZ(x) ((int)(x).size())
#define PB push_back
#define PF push_front
#define POB pop_back
#define POF pop_front
#define MP make_pair
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef map<int,int> mpi;
typedef set<int> sti;
typedef vector<pii> vii;
typedef map<pii,int> mpii;
typedef set<pii> stii;
typedef long double ld;
typedef long long ll;
int gcd(int x,int y){ return (!y ? x : gcd(y, x%y)); }
int power(int x, int y) { return (!y ? 1 : power(x, y / 2) * power(x, y / 2) * (y % 2 ? x : 1)); }
int to_int(string sconvert){stringstream geek(sconvert);int xconvert = 0; geek >> xconvert; return xconvert;}
int fastMax(int x, int y) { return (((y-x)>>(32-1))&(x^y))^y; }
int fastMin(int x, int y) { return (((y-x)>>(32-1))&(x^y))^x; }
const int MAXN=2e6+30,MAX_LOG=30,MOD=1e9+7,INF=1e18;
const double PI = acos(-1);
int mod(int x) { return (x % MOD + MOD) % MOD; }
int n, m, q;

// int parent[MAXN], sz[MAXN], population[MAXN];
// int eu[MAXN], ev[MAXN], ew[MAXN];
// int query_x[MAXN], query_y[MAXN], ans[MAXN], query_order[MAXN];
// void make_set(){
//     for(int i=1;i<=n;i++)parent[i]=i;
//     for(int i=1;i<=n;i++)sz[i]=1;
// }
// int find_set(int i){
//     if(parent[i]==i)return i;
//     else return parent[i]=find_set(parent[i]);
// }
// int union_set(int a,int b,int w){
//     int x=find_set(a);
//     int y=find_set(b);
//     if(x==y){
//         population[x]+=w;
//         return 0;
//     }
//     if(sz[x]>sz[y])swap(x,y);
//     parent[x]=y;
//     sz[y]+=sz[x];
//     population[y]+=population[x]+w;
//     return 1;
// }
// bool compare_queries(int left,int right){
//     return query_y[left]<query_y[right];
// }


int MAIN(){
    cin>>n;
    int min_sum = INF;
    int max_sum = -1LL*INF;
    int min_diff = INF;
    int max_diff = -1LL*INF;
    for(int i = 0; i < n; i++){
        int x, y;
        cin>>x>>y;
        min_sum = min(min_sum,x+y);
        max_sum = max(max_sum,x+y);
        min_diff = min(min_diff,x-y);
        max_diff = max(max_diff,x-y);
    }

    int center_x = (min_sum+max_sum+min_diff+max_diff)/4;
    int center_y = (min_sum+max_sum-min_diff-max_diff)/4;
    int best_x = center_x;
    int best_y = center_y;
    int best_dist = INF;
    for(int x = center_x-2; x <=center_x+2; x++){
        for(int y = center_y-2;y <= center_y+2; y++){
            int curr_dist=0;
            curr_dist = max(curr_dist, max_sum-(x+y));
            curr_dist = max(curr_dist, (x+y)-min_sum);
            curr_dist = max(curr_dist, max_diff-(x-y));
            curr_dist = max(curr_dist, (x-y)-min_diff);
            if(curr_dist<best_dist){
                best_dist = curr_dist;
                best_x = x;
                best_y = y;
            }
        }
    }

    cout<<best_x<<' '<<best_y<<endl;
    return 0;
}

int32_t main(){
    IOS;
    int t=1;
    //cin>>t;
    while(t--)MAIN();
    return 0;
}

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED

Test 3

Verdict: ACCEPTED

Test 4

Verdict: ACCEPTED

Test 5

Verdict: ACCEPTED

Test 6

Verdict: ACCEPTED

Test 7

Verdict: ACCEPTED

Test 8

Verdict: ACCEPTED

Test 9

Verdict: ACCEPTED

Test 10

Verdict: ACCEPTED

Test 11

Verdict: ACCEPTED

Test 12

Verdict: ACCEPTED

Test 13

Verdict: ACCEPTED

Test 14

Verdict: ACCEPTED

Test 15

Verdict: ACCEPTED

Test 16

Verdict: ACCEPTED

Test 17

Verdict: ACCEPTED

Test 18

Verdict: ACCEPTED

Test 19

Verdict: ACCEPTED

Test 20

Verdict: ACCEPTED

Test 21

Verdict: ACCEPTED

Test 22

Verdict: ACCEPTED

Test 23

Verdict: ACCEPTED

Test 24

Verdict: ACCEPTED

Test 25

Verdict: ACCEPTED

Test 26

Verdict: ACCEPTED

Test 27

Verdict: ACCEPTED

Test 28

Verdict: ACCEPTED

Test 29

Verdict: ACCEPTED

Test 30

Verdict: ACCEPTED

Test 31

Verdict: ACCEPTED

Test 32

Verdict: ACCEPTED

Test 33

Verdict: ACCEPTED

Test 34

Verdict: ACCEPTED

Test 35

Verdict: ACCEPTED

Test 36

Verdict: ACCEPTED

Test 37

Verdict: ACCEPTED

Test 38

Verdict: ACCEPTED

Test 39

Verdict: ACCEPTED

Test 40

Verdict: ACCEPTED

Test 41

Verdict: ACCEPTED

Test 42

Verdict: ACCEPTED

Test 43

Verdict: ACCEPTED

Test 44

Verdict: ACCEPTED

Test 45

Verdict: ACCEPTED

Test 46

Verdict: ACCEPTED

Test 47

Verdict: ACCEPTED

Test 48

Verdict: ACCEPTED

Test 49

Verdict: ACCEPTED

Test 50

Verdict: ACCEPTED

Test 51

Verdict: ACCEPTED

Test 52

Verdict: ACCEPTED

Test 53

Verdict: ACCEPTED

Test 54

Verdict: ACCEPTED

Test 55

Verdict: ACCEPTED

Test 56

Verdict: ACCEPTED

Test 57

Verdict: ACCEPTED

Test 58

Verdict: ACCEPTED

Test 59

Verdict: ACCEPTED

Test 60

Verdict: ACCEPTED

Test 61

Verdict: ACCEPTED

Test 62

Verdict: ACCEPTED

Test 63

Verdict: ACCEPTED

Test 64

Verdict: ACCEPTED

Test 65

Verdict: ACCEPTED

Test 66

Verdict: ACCEPTED

Test 67

Verdict: ACCEPTED

Test 68

Verdict: ACCEPTED

Test 69

Verdict: ACCEPTED

Test 70

Verdict: ACCEPTED

Test 71

Verdict: ACCEPTED

Test 72

Verdict: ACCEPTED

Test 73

Verdict: ACCEPTED

Test 74

Verdict: ACCEPTED

Test 75

Verdict: ACCEPTED

Test 76

Verdict: ACCEPTED

Test 77

Verdict: ACCEPTED