Amo La Mia Pizza Dynamic Programming

In this Problem can anyone explain the test case?
according to me answer of test case should be 1700 as in given time we can bake pizza 1 and pizza 2 and that will lead to max profit!
1 Like

@d1k1 : Yes its the standard knapsack problem. The setters were really great. During the contest it was value “100” in place of “1000” thus giving 1480 as result, though due to their wrong test data noone was able to AC their soln.
Now, very wisely they have changed it to “1000” but still its not getting AC for either 1700 or 1480. Height of noobness!

PS: Stop wasting time in these problems.


thank you very much!
i just read knapsack so was trying some problems!