Maximum Performance of a Team LeetCode solution in JavaScript

1
var maxPerformance = function (n, speed, efficiency, k) {
2
  let ord = Array.from({ length: n }, (_, i) => i);
3
  ord.sort((a, b) => efficiency[b] - efficiency[a]);
4
  let sppq = new MinPriorityQueue(),
5
    totalSpeed = 0n,
6
    best = 0n;
7
  for (let eng of ord) {
8
    sppq.enqueue(speed[eng]);
9
    if (sppq.size() <= k) totalSpeed += BigInt(speed[eng]);
10
    else totalSpeed += BigInt(speed[eng] - sppq.dequeue().element);
11
    let res = totalSpeed * BigInt(efficiency[eng]);
12
    if (res > best) best = res;
13
  }
14
  return best % 1000000007n;
15
};