#leetcode簽到
2070. Most Beautiful Item for Each Query

找最大 => heap
每次重新長heap 太慢？
把queries也sort 然後建dict 去映射回原本的queries 大偷懶

class Solution:
    def maximumBeauty(self, items: List[List[int]], queries: List[int]) -> List[int]:
        items.sort(key=lambda x:x[0])
        ans=[]
        h=[]
        ind=0
        d=defaultdict(int)
        for i in sorted(queries):
            while ind<len(items) and items[ind][0]<=i :
                heapq.heappush(h,-items[ind][1])
                ind+=1
            if h:
                d[i]=-h[0]     
            
        for i in queries:
            ans.append(d[i])        
        return ans