[Python3] greedy
Please check out this commit for solutions of biweekly 65. \n\nclass Solution:\n    def maximumBeauty(self, items: List[List[int]], queries: List[int]) -> List[
Please check out this [commit](https://github.com/gaosanyong/leetcode/commit/e61879b77928a08bb15cc182a69259d6e2bce59a) for solutions of biweekly 65. \n```\nclass Solution:\n    def maximumBeauty(self, items: List[List[int]], queries: List[int]) -> List[int]:\n        items.sort()\n        ans = [0]*len(queries)\n        prefix = ii = 0 \n        for x, i in sorted((x, i) for i, x in enumerate(queries)): \n            while ii < len(items) and items[ii][0] <= x: \n                prefix = max(prefix, items[ii][1])\n                ii += 1\n            ans[i] = prefix\n        return ans \n```
['Python3']