Simple python SortedList solution
```\nfrom sortedcontainers import SortedList\ndef busiestServers(self, k: int, a: List[int], l: List[int]) -> List[int]:\n\tans, pq = Counter(), []\n\tsl = Sort
```\nfrom sortedcontainers import SortedList\ndef busiestServers(self, k: int, a: List[int], l: List[int]) -> List[int]:\n\tans, pq = Counter(), []\n\tsl = SortedList(range(k))\n\tfor req, (t, ld) in enumerate(zip(a, l)):            \n\t\twhile pq and pq[0][0] <= t: sl.add(heappop(pq)[1])\n\t\tif not sl: continue\n\t\ti = sl.bisect_left(req % k)\n\t\tif i >= len(sl): i = 0\n\t\th = sl.pop(i)\n\t\theappush(pq, (t+ld, h))\n\t\tans[h] += 1            \n\tmx = max(ans.values())\n\treturn [h for h in ans if ans[h] == mx]
[]