Leetcode 1882. Process Tasks Using Servers

Simulate assigning tasks that arrive each second to servers, always choosing the available server with the smallest weight (breaking ties by index) and, if none are free, waiting until the next server frees; this is typically implemented using two priority queues (available by weight/index and busy by free time) to produce the assigned-server index for each task.