Balance a list of task durations across a specified number of workers to minimize the maximum workload per worker. Return a list of lists where each inner list contains the tasks assigned to one worker. Use a greedy approach to always assign the next task to the worker with the currently smallest total workload.

Examples:

List<Integer> tasks = new List<Integer>{3, 1, 4, 1, 5};
List<List<Integer>> balanced = balanceSchedule(tasks, 3);
// Results: [[5], [4], [3, 1, 1]] or similar balanced distribution

Hints:

• Track the total workload for each worker to make optimal assignments
• Always assign the next task to the worker with the smallest current workload
• Use a data structure that allows efficient tracking of worker loads
• Return lists in the same order as workers were created