USACO Platinum 2016 February - Load Balancing

Time Complexity: $\mathcal{O}(N\log N)$

The official solution uses a segment tree, which is introduced in Gold. However, we can just binary search on the answer.

#include <bits/stdc++.h>
using namespace std;
 
using ll = long long;
using ld = long double;
using db = double; 
using str = string; // yay python!

using pi = pair<int,int>;
using pl = pair<ll,ll>;