← All problemsSign in

Power Sum

CodeChefRating 2614Open on judge ↗

Chef is preparing a brand new dish. He found $N$ new ingredients (numbered $1$ through $N$) for the dish. For each valid $i$, the $i$-th ingredient costs $C_i$ dollars and it has value $V_i$. Chef has a budget: $S$ dollars. He can buy each ingredient at most once. A non-empty subset of these $N$ ingredients (possibly containing all ingredients) is called *affordable* if the sum of costs of all th

HINT LADDERno hints yet
L1 Observation
L2 Technique
L3 Approach
L4 Pseudo-code
🔒
L5 Full solution
L5 unlocks only if you insist twice
solution.cppC++17

CodeSearch Tutor

Hints, not spoilers — it won’t hand over the full solution unless you insist.

voice by Sarvam AI

Sign in to chat with the tutor and save your progress.

Sign in to start