Language: C++

#include<bits/stdc++.h>

#define endl "\n"
#define pb   push_back
#define ll   long long

#define W(t)            while(t--)
#define clr(a)          memset(a,0,sizeof(a))
#define rep(i,a,b)      for(i = a; i < b; i++)
using namespace std;

bool cmp(pair<ll, ll> a, pair<ll, ll> b,pair<ll, ll> c)
{
  // ll x =
  return a.first + a.second < b.first + b.second;
}
int main()
{
  ll n, i, j;
  cin >> n;
  pair<ll, ll> a[n];

  rep(i, 0, n) cin >> a[i].first >> a[i].second;
  sort(a, a + n, cmp);
  cout << a[n - 1].first - a[0].first + a[n - 1].second - a[0].second;

  return 0;
}

Compiler output:
In file included from /usr/include/c++/14/bits/stl_algobase.h:71,
                 from /usr/include/c++/14/algorithm:60,
                 from /usr/include/x86_64-linux-gnu/c++/14/bits/stdc++.h:51,
                 from a.cc:1:
/usr/include/c++/14/bits/predefined_ops.h: In instantiation of 'constexpr bool __gnu_cxx::__ops::_Iter_comp_iter<_Compare>::operator()(_Iterator1, _Iterator2) [with _Iterator1 = std::pair<long long int, long long int>*; _Iterator2 = std::pair<long long int, long long int>*; _Compare = bool (*)(std::pair<long long int, long long int>, std::pair<long long int, long long int>, std::pair<long long int, long long int>)]':
/usr/include/c++/14/bits/stl_algo.h:1777:14:   required from 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair<long long int, long long int>*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(pair<long long int, long long int>, pair<long long int, long long int>, pair<long long int, long long int>)>]'
 1777 |           if (__comp(__i, __first))
      |               ~~~~~~^~~~~~~~~~~~~~
/usr/include/c++/14/bits/stl_algo.h:1817:25:   required from 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair<long long int, long long int>*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(pair<long long int, long long int>, pair<long long int, long long int>, pair<long long int, long long int>)>]'
 1817 |           std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
      |           ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/14/bits/stl_algo.h:1908:31:   required from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair<long long int, long long int>*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(pair<long long int, long long int>, pair<long long int, long long int>, pair<long long int, long long int>)>]'
 1908 |           std::__final_insertion_sort(__first, __last, __comp);
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/14/bits/stl_algo.h:4805:18:   required from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = pair<long long int, long long int>*; _Compare = bool (*)(pair<long long int, long long int>, pair<long long int, long long int>, pair<long long int, long long int>)]'
 4805 |       std::__sort(__first, __last, __gnu_cxx::__ops::__iter_comp_iter(__comp));
      |       ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
a.cc:24:7:   required from here
   24 |   sort(a, a + n, cmp);
      |   ~~~~^~~~~~~~~~~~~~~
/usr/include/c++/14/bits/predefined_ops.h:158:30: error: too few arguments to function
  158 |         { return bool(_M_comp(*__it1, *__it2)); }
      |                       ~~~~~~~^~~~~~~~~~~~~~~~
/usr/include/c++/14/bits/predefined_ops.h: In instantiation of 'bool __gnu_cxx::__ops::_Val_comp_iter<_Compare>::operator()(_Value&, _Iterator) [with _Value = std::pair<long long int, long long int>; _Iterator = std::pair<long long int, long long int>*; _Compare = bool (*)(std::pair<long long int, long long int>, std::pair<long long int, long long int>, std::pair<long long int, long long int>)]':
/usr/include/c++/14/bits/stl_algo.h:1757:20:   required from 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair<long long int, long long int>*; _Compare = __gnu_cxx::__ops::_Val_comp_iter<bool (*)(pair<long long int, long long int>, pair<long long int, long long int>, pair<long long int, long long int>)>]'
 1757 |       while (__comp(__val, __next))
      |              ~~~~~~^~~~~~~~~~~~~~~
/usr/include/c++/14/bits/stl_algo.h:1785:36:   required from 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair<long long int, long long int>*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(pair<long long int, long long int>, pair<long long int, long long int>, pair<long long int, long long int>)>]'
 1785 |             std::__unguarded_linear_insert(__i,
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~
 1786 |                                 __gnu_cxx::__ops::__val_comp_iter(__comp));
      |                                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/14/bits/stl_algo.h:1817:25:   required from 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair<long long int, long long int>*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(pair<long long int, long long int>, pair<long long int, long long int>, pair<long long int, long long int>)>]'
 1817 |           std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
      |           ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/14/bits/stl_algo.h:1908:31:   required from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair<long long int, long long int>*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(pair<long long int, long long int>, pair<long long int, long long int>, pair<long long int, long long int>)>]'
 1908 |           std::__final_insertion_sort(__first, __last, __comp);
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/14/bits/stl_algo.h:4805:18:   required from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = pair<long long int, long long int>*; _Compare = bool (*)(pair<long long int, long long int>, pair<long long int, long long int>, pair<long long int, long long int>)]'
 4805 |       std::__sort(__first, __last, __gnu_cxx::__ops::__iter_comp_iter(__comp));
      |       ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
a.cc:24:7:   required from here
   24 |   sort(a, a + n, cmp);
      |   ~~~~^~~~~~~~~~~~~~~
/usr/include/c++/14/bits/predefined_ops.h:240:30: error: too few arguments to function
  240 |         { return bool(_M_comp(__val, *__it)); }
      |                       ~~~~~~~^~~~~~~~~~~~~~
/usr/include/c++/14/bits/predefined_ops.h: In instantiation of 'bool __gnu_cxx::__ops::_Iter_comp_val<_Compare>::operator()(_Iterator, _Value&) [with _Iterator = std::pair<long long int, long long int>*; _Value = std::pair<long long int, long long int>; _Compare = bool (*)(std::pair<long long int, long long int>, std::pair<long long int, long long int>, std::pair<long long int, long long int>)]':
/usr/include/c++/14/bits/stl_heap.h:140:48:   required from 'void std::__push_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare&) [with _RandomAccessIterator = pair<long long int, long long int>*; _Distance = long int; _Tp = pair<long long int, long long int>; _Compare = __gnu_cxx::__ops::_Iter_comp_val<bool (*)(pair<long long int, long long int>, pair<long long int, long long int>, pair<long long int, long long int>)>]'
  140 |       while (__holeIndex > __topIndex && __comp(__first + __parent, __value))
      |                                          ~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/14/bits/stl_heap.h:247:23:   required from 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = pair<long long int, long long int>*; _Distance = long int; _Tp = pair<long long int, long long int>; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(pair<long long int, long long int>, pair<long long int, long long int>, pair<long long int, long long int>)>]'
  247 |       std::__push_heap(__first, __holeIndex, __topIndex,
      |       ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  248 |                        _GLIBCXX_MOVE(__value), __cmp);
      |                        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/14/bits/stl_heap.h:356:22:   required from 'void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = pair<long long int, long long int>*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(pair<long long int, long long int>, pair<long long int, long long int>, pair<long long int, long long int>)>]'
  356 |           std::__adjust_heap(__first, __parent, __len, _GLIBCXX_MOVE(__value),
      |           ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
  357 |                              __comp);
      |                              ~~~~~~~
/usr/include/c++/14/bits/stl_algo.h:1593:23:   required from 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair<long long int, long long int>*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(pair<long long int, long long int>, pair<long long int, long long int>, pair<long long int, long long int>)>]'
 1593 |       std::__make_heap(__first, __middle, __comp);
      |       ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/14/bits/stl_algo.h:1868:25:   required from 'void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = pair<long long int, long long int>*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(pair<long long int, long long int>, pair<long long int, long long int>, pair<long long int, long long int>)>]'
 1868 |       std::__heap_select(__first, __middle, __last, __comp);
      |       ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/14/bits/stl_algo.h:1884:27:   required from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = pair<long long int, long long int>*; _Size = long int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<bool (*)(pair<long long int, long long int>, pair<long long int, long long int>, pair<long long int, long long int>)>]'
 1884 |               std::__partial_sort(__first, __last, __last, __comp);
      |               ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/14/bits/stl_algo.h:190