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.

1#include <bits/stdc++.h>
2using namespace std;
3 
4using ll = long long;
5using ld = long double;
6using db = double; 
7using str = string; // yay python!
8
9using pi = pair<int,int>;
10using pl = pair<ll,ll>;