Chef Goes Shopping

CodeChefRating 2164Open on judge ↗

MoEngage goes shopping with Chef. There are $N$ ingredients placed on a line, numbered $1$ to $N$ from left to right. At any point in time, MoEngage can choose the ingredient numbered $x$ and do **one** of the following operations: - If the chosen ingredient is not the leftmost amongst the remaining ingredients, **remove the left neighbor**. This operation costs $L_x$ coins. - If the chosen ingre

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