Leetcode 2979. Most Expensive Item That Can Not Be Bought

Given a list of item prices, a set of available discounts/price adjustments, and a budget, determine the most expensive single item that remains unaffordable even after applying discounts optimally. The problem reduces to testing affordability per item with the best discount and is typically solved with sorting plus greedy checks or binary search for efficiency.