Python3 - simulate servers using sorted list and heap
\nfrom sortedcontainers import SortedList\nfrom heapq import heappush, heappop\n\nclass Solution:\n    def busiestServers(self, k: int, arrival: List[int], load
```\nfrom sortedcontainers import SortedList\nfrom heapq import heappush, heappop\n\nclass Solution:\n    def busiestServers(self, k: int, arrival: List[int], load: List[int]) -> List[int]:\n        processed = [0]*k\n        ready = SortedList(list(range(k)))\n        processing = []  # (ready time, server number)\n        for i, a, l in zip(range(len(arrival)), arrival, load):\n            while processing and processing[0][0] <= a:\n                _, s = heappop(processing)\n                ready.add(s)\n            \n            if not ready:\n                continue\n            index = ready.bisect_left(i%k)\n            if index == len(ready):\n                index = 0\n            s = ready[index]\n            ready.pop(index)\n            processed[s] += 1\n            heappush(processing, (a+l, s))\n\n        m = max(processed)\n        return [i for i in range(k) if processed[i] == m]\n\n```
['Python3']