hello! please read the task again to find out. i don't want to give you a spoiler, good luck!

I just fixed the test cases. Sorry for the inconvenience.

If you won't consider the very little variation that you just add extra conditions, then it won't be. I'll change the statement for you and other testers to understand it clearer.

This problem is for beginners to learn loops and conditions, and it may serve as an introduction to dynamic programming. That's why the contraints are very low. So, unlike considering this just a stripped-down knapsack problem, consider this as a problem for beginners to learn the basics they need to understand other deeper algos and data structs.

Hi, thanks! I just added some random tests.

It seems like you need to signup for the contest. To do that, sign in first here: https://www.hackerrank.com/apc-practice-page/. Then, go to the link I gave. I will fix the statement real quick.

Fixed. Thank you!