There is a hotel with n rooms. You are given a $2$D integer array rooms where rooms[i] = [$\text{roomId}_i$, $\text{size}_i$] represents a room with an identifier $\text{roomId}_i$ and a size $\text{size}_i$. Each room identifier is distinct.

You are also given a $2$D integer array queries of length k, where queries[j] = [$\text{preferred}_j$, $\text{minSize}_j$].

For each query j, you need to find a room with identifier $\text{roomId}_i$ such that:

• The size of the room is at least $\text{minSize}_j$ ($\text{size}_i \geq \text{minSize}_j$).

• The absolute difference between $\text{roomId}_i$ and $\text{preferred}_j$ ($| \text{roomId}_i - \text{preferred}_j|$) is minimized.

If there is a tie, choose the room with the smallest $\text{roomId}_i$. If no room satisfies the size requirement, the answer for that query is $-1$.

Return an array answer of length k containing the result for each query.

Constraints:

• n $==$ rooms.length

• $1 \leq$ n $\leq 10^5$

• k $==$ queries.length

• $1 \leq$ k $\leq 10^4$

• $1 \leq \text{roomId}_i, \text{preferred}_j \leq 10^7$

• $1 \leq \text{size}_i, \text{minSize}_j \leq 10^7$

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.