Leetcode 2895. Minimum Processing Time

Partition 4n tasks into n groups of four and assign each group to a processor so as to minimize the makespan, where a processor's completion time is its availability time plus the largest task duration in its assigned group. Return the minimum possible maximum completion time across all processors.