Day 142 : Minimum Cost to Fill Given Weight
Approach : unbounded knapsack — dp[i] = min cost to make exactly i kg, try every available packet weight j and relax dp[i] with dp[i-j] cost[j-1], skipping unreachable states; return -1 if dp[w] stays unreached
@geeksforgeeks #GFG