1
var reconstructQueue = function (people) {
2
  var queue = new Array(people.length);
3
  people = people.sort((a, b) => a[0] - b[0]);
4
  for (let i = 0; i < people.length; i++) {
5
    let count = 0;
6
    for (let j = 0; j < queue.length; j++) {
7
      if (!queue[j]) {
8
        if (count == people[i][1]) {
9
          queue[j] = people[i];
10
          break;
11
        }
12
        count++;
13
      } else if (queue[j][0] >= people[i][0]) {
14
        count++;
15
      }
16
    }
17
  }
18
  return queue;
19
};