https://atcoder.jp/contests/dp/tasks/dp_e
this is knapsack problem with tough constraints so making dp table is not feasible (100*(10^9))
How this can be approcahed ?
https://atcoder.jp/contests/dp/tasks/dp_e
this is knapsack problem with tough constraints so making dp table is not feasible (100*(10^9))
How this can be approcahed ?
sorta like coin exchange problem, where you try to get the minimum weight for each possible value
https://www.youtube.com/watch?v=FAQxdm0bTaw