Single-Threaded CPU
Medium
Heap Scheduling Problems
Each task is given as (enqueueTime, processingTime). The CPU picks, among the available tasks, the one with the shortest processing time (ties: smallest index), runs it to completion, and if idle jumps to the next enqueue time. Print the order in which tasks are processed.
Constraints
1 <= n <= 10^5 1 <= enqueueTime, processingTime <= 10^9
Discussion
No discussions yet.
Shalyam Support
Hi! Ask us anything — we'll reply on WhatsApp or Telegram within 24 hours.