Submission

Score: 100

User: GastrointestinalTrackInflammation

Problemset: สายไฟแนวทแยง

Language: cpp

Time: 0.022 second

Submitted On: 2026-10-06 15:27:46

#include<bits/stdc++.h>

using namespace std;

#define inall(x) for(auto& i:x)cin>>i;
#define outall(x) {for(auto i:x)cout<<i<<' ';cout<<endl;}
#define ini(x,y) for(auto& i:x)i=y;
#define tout(x) cout<<"DEBUG! :"<<x<<endl;
#define rout(x) {cout<<x<<endl;return;}
using ll = long long;
using df = double;

template<typename pair1,typename pair2>
istream& operator>>(istream& in,pair<pair1,pair2>&p) {return in>>p.first>>p.second;}

template <typename pair1, typename pair2>
ostream& operator<<(ostream& out,const pair<pair1,pair2>&p) {return out<<endl<<p.first<<' '<< p.second;}

void solve(){
    int n;
    cin>>n;
    ll up[n],down[n];
    for(int i=0;i<n;i++){
        int x,y;
        cin>>x>>y;
        up[i]=x+y;
        down[i]=x-y;
    }
    sort(up,up+n);
    sort(down,down+n);
    ll mu=up[n/2],md=down[n/2];
    ll ans=0;
    for(int i=0;i<n;i++){
        ans+=abs(mu-up[i]);
        ans+=abs(md-down[i]);
    }
    cout<<ans<<endl;
}

int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);cout.tie(nullptr);
    int t=1;
    //cin>>t;
    while(t--)solve();
    return 0;
}