Mysterious Plates

CodeChefOpen on judge ↗

You are in a haunted mansion on Halloween night, and you come across a collection of $N$ mysterious plates, each with its own thickness represented by the array $A$ = $[$ $A₁$, $A₂$, $A₃$, $...$, $Aₙ$ $]$. The plates are placed one on top of the other, and you decide to make them fall onto a hard, eerie floor. When stack of plate falls, they crack till a fixed height of $K$ from bottom. Your goa

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