ANNUAL FAIR

CodeChefOpen on judge ↗

Neha loves bangles. One day she goes to the annual fair near the college. There she finds a huge stall of exotic bangles. The vendor has set up N stacks of bangles where the ith stack has A[i] bangles of beauty values 1,2,3...,A[i]. Neha wants to look the most beautiful among her friends, so she wishes to buy the bangles with the highest beauty value. But she needs to buy only K bangles. Help her

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