Topic: Greedy Algorithm Problem / Level: intermediate
Problem: You are given an array of integers representing tasks, where each element is the time required to complete the task. Assign the tasks to two processors such that the total completion time is minimized.