House Robber IV

Select at least k non-adjacent houses so as to minimize the maximum value stolen from any chosen house — equivalently, find the smallest threshold T such that you can pick ≥k elements ≤T with no two adjacent. This is a feasibility-search problem (check if a candidate T allows ≥k picks under the non‑adjacency constraint) over the value range.