Leetcode 2234. Maximum Total Beauty of the Gardens

Choose which gardens to raise to at least target using at most newFlowers to maximize full * (#complete) + partial * (minimum flowers among incomplete gardens). The problem reduces to sorting and using prefix sums to try each possible number of completed gardens and greedily/binary-search raising the minimum of the rest with leftover flowers to find the maximum beauty.