Chef and Sweet Dish

CodeChefOpen on judge ↗

Chef has got an order from his customer to make $T$ sweet dishes and deliver it in $minimum$ time to the customer. Chef has $N$ ovens and in one oven exactly one sweet dish can be made at a time. For each oven, Chef knows the number of time it require to make a single sweet dish. The ovens can work simultaneously. Help chef to deliver the $T$ sweet dishes to the customer in minimum time. NOTE:

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