Minimize the Worst Delay — Solution & Editorial

Back to the Problem

Earliest-deadline-first is optimal (exchange argument): sort by deadline, run in that order, and track the maximum finish−deadline.

Complexity: O(N log N)