1def maxBeautyForQueries(items, queries):
2    items = sorted(items)
3    max_beauty = [0] * len(items)
4    current_max = 0
5
6    for i, (price, beauty) in enumerate(items):
7        current_max = max(current_max, beauty)
8        max_beauty[i] = current_max
9
10    def findBest(query):
11        left, right = 0, len(items) - 1
12        while left <= right:
13            mid = (left + right) // 2
14            if items[mid][0] <= query:
15                left = mid + 1
16            else:
17                right = mid - 1
18        return max_beauty[right] if right >= 0 else 0
19
20    return [findBest(q) for q in queries]
21
22# Example usage
23items = [[1,2],[3,2],[2,4],[5,6],[3,5]]
24queries = [1,2,3,4,5,6]
25print(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));
    }
}