Assignment of Tasks
You have $N$ tasks, indexed $1$ to $N$, where the $i$-th of which takes $A_i$ time to be completed by a skilled worker, and can be started only after the time $S_i$ (including exactly at $S_i$). You have $M$ workers, indexed $1$ to $M$, where the $i$-th of which has a skill deficiency factor of $F_i$ meaning that if a skilled worker would take $t$ time to complete the task, this worker will take
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.
Sign in to chat with the tutor and save your progress.
Sign in to start