Task Times

CodeChefRating 2341Open on judge ↗

Chef's exam is near. There is a total of $M$ subjects in his syllabus. Each subject consists of several topics. However, the questions will be set only from $N$ topics. These topics are numbered $1$ through $N$. The $i^{th}$ topic belongs to $C_i^{th}$ subject and takes $T_i$ hours to cover. Chef has only $K$ hours left before the exam and wants to score the maximum marks. If Chef covers $x_1$ n

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