Manhattan sightseeing

input/code.cpp: In lambda function:
input/code.cpp:82:46: warning: unused variable 'dist' [-Wunused-variable]
   82 |         int low = mny, high = mxy, ans = -1, dist = -1;
      |                                              ^~~~

#include <algorithm>
#include <bits/stdc++.h>
#include <string>
using namespace std;
#define sz(x) (int)(x).size()
#define all(x) (x).begin(), (x).end()
#define int long long

string to_string(string s) {
    return '"' + s + '"';
}
 
string to_string(const char* s) {
    return to_string((string) s);
}
 
string to_string(bool b) {
    return (b ? "true" : "false");
}
 
template <typename A, typename B>
string to_string(pair<A, B> p) {
    return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";
}
 
template <typename A>
string to_string(A v) {
    bool first = true;
    string res = "{";
    for (const auto &x : v) {
        if (!first) {
            res += ", ";
        }
        first = false;
        res += to_string(x);
    }
    res += "}";
    return res;
}
 
void debug_out() {
    cerr << endl;
}
 
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
    cerr << " " << to_string(H);
    debug_out(T...);
}
 
#ifdef LOCAL
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#else
#define debug(...) 42
#endif

const int N = 1e5 + 5;
const int INF = 1e9;

int n, x[N], y[N];

void solve() {
    cin >> n;
    int mxx = 0, mnx = INF, mxy = 0, mny = INF;
    for (int i = 1; i <= n; i++) {
        cin >> x[i] >> y[i];
        mxx = max(mxx, x[i]);
        mxy = max(mxy, y[i]);
        mnx = min(mnx, x[i]);
        mny = min(mny, x[i]);
    }

    auto mxdist = [&](int posx, int posy) -> int {
        int ans = 0;
        for (int i = 1; i <= n; i++) {
            ans = max(ans, abs(posx - x[i]) + abs(posy - y[i]));
        }
        return ans;
    };

    auto calc = [&](int posx) -> int {
        int low = mny, high = mxy, ans = -1, dist = -1;
        while (low <= high) {
            int mid = (low + high) / 2;
            if (mxdist(posx, mid) >= mxdist(posx, mid + 1)) {
                low = mid + 1;
                ans = mid + 1;
            } else {
                high = mid - 1;
                ans = mid;
            }
        } 
        return mxdist(posx, ans);
    };

    auto findcalc = [&](int posx) -> int {
        int low = mny, high = mxy, ans = -1;
        while (low <= high) {
            int mid = (low + high) / 2;
            if (mxdist(posx, mid) >= mxdist(posx, mid + 1)) {
                low = mid + 1;
                ans = mid + 1;
            } else {
                high = mid - 1;
                ans = mid;
            }
        } 
        return ans;
    };

    int lowx = mnx, highx = mxx, ansx = -1;
    while (lowx <= highx) {
        int midx = (lowx + highx) / 2;
        if (calc(midx) >= calc(midx + 1)) {
            lowx = midx + 1;
            ansx = midx + 1;
        } else {
            highx = midx - 1;
            ansx = midx;
        }
    } 

    cout << ansx << ' ' << findcalc(ansx) << '\n';
}

signed main() {
    cin.tie(0)->sync_with_stdio(0);
            
    int t = 1;
    // cin >> t;

    while (t--) {
        solve();
    }
}

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: WRONG ANSWER

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