Submission #16705345

---

Source Code Expand

// Hail god Yato
 
#include <bits/stdc++.h> 
using namespace std;
 
#define hs ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
typedef long long ll;
const ll MOD = 1000000007;
const ll INF = 1e18;
const ll MAX = 1e9+1;
//
//
bool oper(const pair<ll, ll>& fst, const pair<ll, ll>& snd){
    return (fst.first + fst.second) < (snd.first + snd.second);
}
void solve(){
    ll n;
    cin>>n;
    vector<pair<ll, ll>> vec(n);
    for(int i = 0; i < n; i++)
        cin>>vec[i].first>>vec[i].second;
    sort(vec.begin(), vec.end(), oper);
    ll ans = 0;
    pair<ll, ll> fst = vec[0], snd = vec[n-1];
    ans = max(ans, abs(snd.first - fst.first) + abs(snd.second - fst.second));
    // cout<<ans;
    for(int i = 0; i < n; i++)
        vec[i].second = MAX - vec[i].second;
    sort(vec.begin(), vec.end(), oper);
    fst = vec[0], snd = vec[n-1];
    ans = max(ans, abs(snd.first - fst.first) + abs(snd.second - fst.second));
    cout<<ans;
}
int main(){ 
        hs;
        ll t;
        t=1;
        // cin>>t;
        for (int i=1; i<=t; i++){
                //cout<<"Case #"<<i<<": ";
                solve();
         }
        return 0; 
}

Submission Info

Judge Result