The Mess Problem

CodeChefOpen on judge ↗

In the NIT Trichy mess it takes ti time to serve the ith customer in the queue. The waiting time for the ith customer is the sum of the serving times for all customers before him. A hosteller in the queue is happy if the total waiting time for him/her is less than or equal to his/her serving time The mess manager swaps a few people in the queue in order to achieve the maximum number of happy

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