HELP!!!

CodeChefOpen on judge ↗

A is working on a project which has $N$ sections and every section has some difficulty level given in array $diff$. A cannot skip any of the section (complete the project in sequential manner). A has a best friend B who is expert and who can help him when A is not able to complete the section. But B has its own project so he can help A only $X$ times. A has $K$ amount of time to complete 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