Costly Swapping

CodeChefRating 3023Open on judge ↗

Chef and Chefina are shopping for ingredients. The shop has $N$ ingredients, arranged in a row from left to right. The $i$-th ingredient has a weight of $W_i$ units. Each ingredient has the same cost, that being $C$ coins. Chef's bag can carry a weight of upto $M$ units. Chef will shop greedily; that is, he'll perform the following process: - For each $i$ from $1$ to $N$ in order, if it's p

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