Maximum Score

CodeChefOpen on judge ↗

Afrose is busy with lots of work. He has $n$ tasks to be completed. Two arrays named $score$ and $time$ are given, where score[i] and time[i] denotes the score and the time taken to complete the task i respectively. He has $k$ time. Calculate the maximum score he can gain by completing the tasks within $k$ time. Note: Score is given only when the task is finished completely. Copy the buggy code f

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