← All problemsSign in

Main Entrance

To make a successful $Money$ $Heist$, $Berlin$ takes charge of the safety of main entrance. He must eliminate **‘N’** soldiers who are trying to break the entrance of the bank hall. Each $i-th$ soldier has strength of $a_i$. In one move, he can do either of the following: - Shoot down at most any **‘K’** soldiers. In other words, he can shoot down any set of soldiers such that the size of tha

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