← All problemsSign in

Parallel Processing

CodeChefRating 1425Open on judge ↗

There are $N$ tasks waiting in line to be executed. The execution time for the $i^{th}$ task is $A_i$ seconds. Chef has **two processors** to execute these $N$ tasks. Both these processors work simultaneously. Each processor executes the assigned tasks one by one. Chef assigns a **prefix** of these tasks to the first processor and the remaining tasks to the second processor. For example, if

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

Sign in to chat with the tutor and save your progress.

Sign in to start