Select for us

CodeChefOpen on judge ↗

You are a hiring manager in MegaHard and You have been given a task to shortlist candidates. You have decided to shortlist at least $K$ candidates out of $N$ candidates. You want everyone to have an equal chance and if any two candidates have solved the same number of problems you have decided to call both of them :). Given a list $S$ of the number of solved problems by candidates calculate the mi

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