Python faster than 99.78% (1124ms)
```\nclass Solution:\n    def maximumBeauty(self, items: List[List[int]], queries: List[int]) -> List[int]:\n        to_check = queries.copy()\n        to_check
```\nclass Solution:\n    def maximumBeauty(self, items: List[List[int]], queries: List[int]) -> List[int]:\n        to_check = queries.copy()\n        to_check = sorted(to_check)[::-1]\n        items = sorted(items, key=lambda x:x[0])\n        items = items[::-1]\n        max_beauty = 0\n        ans_lookup = dict()\n        while to_check:\n            while items and items[-1][0] <= to_check[-1]:\n                max_beauty = max(max_beauty,items.pop()[1])\n            ans_lookup[to_check.pop()] = max_beauty\n        return [ans_lookup[x] for x in queries]
[]