constructor(n) {
        this.unreserved = new MinPriorityQueue({
            compare: (a, b) => a - b
        });

        for (let i = 1; i < n + 1; i++) {
            this.unreserved.enqueue(i);
        }
    }
MinHeap
Time O(n*log(n)) | Space O(n)
https://leetcode.com/problems/seat-reservation-manager/
@param {number} n