Leetcode 2548. Maximum Price to Fill a Bag

Given item types each with a weight and a price, determine the maximum total price you can achieve by choosing nonnegative quantities of the types to exactly fill a bag of given capacity (or report impossibility). This is an unbounded knapsack / coin-change style optimization balancing weight constraints and value.