Function cuttingWood

cpp/Binary Search/cutting_wood.cpp:4–18

#include <algorithm>

int cuttingWood(std::vector<int>& heights, int k) {
    int left = 0;
    int right = *std::max_element(heights.begin(), heights.end());
    while (left < right) {
        // Bias the midpoint to the right during the upper-bound binary 
        // search.
        int mid = (left + right) / 2 + 1;
        if (cutsEnoughWood(mid, k, heights)) {
            left = mid;
        } else {
            right = mid - 1;
        }
    }
    return right;
}

// Determine if the current value of 'H' cuts at least 'k' meters of 
// wood.