Topic: Greedy Algorithm Problem / Level: intermediate
Problem: You are given an array of integers representing tasks, where each element represents the time required to complete the task. Find the minimum total time to complete all tasks using two workers.