1function maxBeautyForQueries(items, queries) {
2    items.sort((a, b) => a[0] - b[0]);
3    const maxBeauty = new Array(items.length);
4    let maxB = 0;
5
6    for (let i = 0; i < items.length; i++) {
7        maxB = Math.max(maxB, items[i][1]);
8        maxBeauty[i] = maxB;
9    }
10
11    function findBest(query) {
12        let left = 0, right = items.length - 1;
13        while (left <= right) {
14            const mid = Math.floor((left + right) / 2);
15            if (items[mid][0] <= query) {
16                left = mid + 1;
17            } else {
18                right = mid - 1;
19            }
20        }
21        return right >= 0 ? maxBeauty[right] : 0;
22    }
23
24    return queries.map(findBest);
25}
26
27// Example usage:
28const items = [[1,2],[3,2],[2,4],[5,6],[3,5]];
29const queries = [1,2,3,4,5,6];
30console.log(maxBeautyForQueries(items, queries));

using System.Collections.Generic;

public class Solution {
    public int[] MaxBeautyWithCompression(int[][] items, int[] queries) {
        var priceSet = new SortedSet<int>();
        foreach (var item in items) priceSet.Add(item[0]);
        foreach (var query in queries) priceSet.Add(query);

        var prices = new List<int>(priceSet);
        var dp = new Dictionary<int, int>();
        foreach (var price in prices) dp[price] = 0;

        foreach (var item in items) {
            dp[item[0]] = Math.Max(dp[item[0]], item[1]);
        }

        int currentMax = 0;
        foreach (var price in prices) {
            currentMax = Math.Max(currentMax, dp[price]);
            dp[price] = currentMax;
        }

        var result = new int[queries.Length];
        for (int i = 0; i < queries.Length; i++) {
            var index = prices.BinarySearch(queries[i]);
            if (index < 0) index = ~index - 1;
            result[i] = index >= 0 ? dp[prices[index]] : 0;
        }

        return result;
    }

    public static void Main(string[] args) {
        var solution = new Solution();
        int[][] items = new int[][] { new int[] {1,2}, new int[] {3,2}, new int[] {2,4}, new int[] {5,6}, new int[] {3,5} };
        int[] queries = new int[] { 1, 2, 3, 4, 5, 6 };
        int[] result = solution.MaxBeautyWithCompression(items, queries);
        Console.WriteLine(string.Join(" ", result));
    }
}