Maximize Tasks Scheduled Within Time Limit

Question

There are n machines, and their IDs run from 0 to n-1 with no repeats. A machine can run as many as m tasks in parallel. You are also given an integer array tasks, where tasks[i] is the number of minutes task i needs to finish. Tasks are packed into the next 60 minutes by running the fixed scheduling procedure below, and your function returns the schedule that this procedure builds. ...