Chef at the Olympics

CodeChefOpen on judge ↗

The Chef is at the Olympics. You are given the medal tally of $N$ of the participating countries. You are also given $Q$ queries, each represented by a single integer $K$. For each such query, you need to find the best possible rank country $1$ can achieve if you are allowed to take **atmost** $K$ medals (possibly of different countries) and change their color. **Note**: - Countries are ranked

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