Shopping Offers

Given unit prices, unlimited-use special bundle offers, and a target quantity for each of up to 6 items, compute the minimum cost to buy exactly those quantities without exceeding them. The core challenge is a small-dimensional combinatorial optimization over the needs vector that’s typically solved by state-space search with pruning/memoization (DFS/DP) to try combinations of offers.