Editorial for DMOPC '17 Contest 2 P1 - 0-1 Knapsack

Remember to use this editorial only when stuck, and not to copy-paste code from it. Please be respectful to the problem author and editorialist.
Submitting an official solution before solving the problem yourself is a bannable offence.

Author: Kirito

Notice that the only items you wish to take are the ones with positive $v_i$ ~v_i~. Thus the minimal $C$ ~C~ is the sum of all $c_i$ ~c_i~ such that $v_i > 0$ ~v_i > 0~.

Time Complexity: $\mathcal O(N)$ ~\mathcal O(N)~

Comments

There are no comments at the moment.