Maximizing Marks

CodeChefOpen on judge ↗

An exam consists of N questions. The marks of the N questions are m1, m2, m3, .. mN respectively. Jam is giving the exam and he wants to maximise his number of marks. However he takes some time to solve each question. The time taken by him to solve the questions are t1, t2, t3, .. tN respectively. The exams lasts for a total of time T. But Jam's teacher is very smart and she knows that Jam wil

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