Closest Room
There is a hotel with n rooms. The rooms are represented by a 2D integer array rooms where rooms[i] = [roomIdi, sizei] denotes that there is a room with room number roomIdi and size equal to sizei. Each roomIdi is guaranteed to be unique.
You are also given k queries in a 2D array queries where queries[j] = [preferredj, minSizej]. The answer to the j^th query is the room number id of a room such that:
- The room has a size of at least
minSizej, and abs(id - preferredj)is minimized, whereabs(x)is the absolute value ofx.
If there is a tie in the absolute difference, then use the room with the smallest such id. If there is no such room, the answer is -1.
Return an array answer of length k where answer[j] contains the answer to the j^th query.
Example 1
Input
rooms = [[2,2],[1,2],[3,2]], queries = [[3,1],[3,3],[5,2]]Output
[3,-1,3]For the three queries, room 3 is closest with sufficient size, no room has size at least 3, and room 3 is closest with size at least 2, respectively.
Example 2
Input
rooms = [[1,4],[2,3],[3,5],[4,1],[5,2]], queries = [[2,3],[2,4],[2,5]]Output
[2,1,3]For the three queries, room 2 is exact with sufficient size, rooms 1 and 3 tie so room 1 is chosen, and room 3 is the only room with size at least 5, respectively.
Constraints
- n == rooms.length
- 1 <= n <= 10^5
- k == queries.length
- 1 <= k <= 10^4
- 1 <= roomIdi, preferredj <= 10^7
- 1 <= sizei, minSizej <= 10^7