#541 · #1882 · Process Tasks Using Servers(使用服务器处理任务)

You are given servers (where servers[i] is the weight of server i) and tasks (where tasks[j] is the time to process task j). Task j arrives at time j. A free server is chosen by smallest weight, then smallest index; if none is free, the task waits for the earliest available. Return the server index assigned to each task. Constraints: 1 <= n, m <= 2 * 10^5.