Minimum K to Reduce Array Within Limit
Binary search the smallest k whose total ceiling-division cost is at most k squared, a condition that only gets easier as k grows.
Binary search the smallest k whose total ceiling-division cost is at most k squared, a condition that only gets easier as k grows.