IPO LeetCode solution in JavaScript

1
var findMaximizedCapital = function (k, w, profits, capital) {
2
  let capitals_asc_queue = new MinPriorityQueue();
3
  let profits_desc_queue = new MaxPriorityQueue();
4
  for (let i = 0; i < capital.length; i++)
5
    capitals_asc_queue.enqueue([capital[i], profits[i]], capital[i]);
6

7
  for (let i = 0; i < k; i++) {
8
    while (
9
      !capitals_asc_queue.isEmpty() &&
10
      capitals_asc_queue.front().element[0] <= w
11
    ) {
12
      let el = capitals_asc_queue.dequeue().element;
13
      profits_desc_queue.enqueue(el, el[1]);
14
    }
15
    if (profits_desc_queue.isEmpty()) return w;
16
    w += profits_desc_queue.dequeue().element[1];
17
  }
18
  return w;
19
};