Prove the direction before binary search on answers

A binary search over answers needs a monotone yes-or-no check: once a value is feasible, all larger values, or all smaller values, must stay feasible. Prove which direction holds before coding, then search for the first or last feasible value.