Submission #3788736

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
//#define int long long
signed main(){
    int n;
    cin >> n;
    int l[n],r[n];
    for(int i=0;i<n;i++){
        cin >> l[i] >>r[i];

    }
    sort(l,l+n,greater<int>());
    sort(r,r+n);
    int ans=0;
    for(int i=0;i<n;i++){
        if(l[i]>r[i]){
            ans+=2*(l[i]-r[i]);
        }else{
            int k=max(l[i],-r[i]);
            ans+=2*max(k,0);
            break;
        }
    }
    cout << ans;
    return 0;
}

Submission Info

Judge Result