You are given a two dimensional integer array items, where items[i] = $[` ext{price}_i`, ` ext{beauty}_i`]$ represents the price and beauty of an item.

You are also given an integer array queries. For each query queries[j], determine the maximum beauty among all items whose price is less than or equal to queries[j]. If no item has a price less than or equal to queries[j], the answer for that query is $0$.

Return an array answer of the same length as queries where answer[j] is the answer to the $j^{ ext{th}}$ query.

Constraints:

• $1 \leq$ items.length, queries.length $\leq 10^5$

• items[i].length $= 2$

• $1 \leq$ price_i, beauty_i, queries[j] $\leq 10^9$

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.