Python. Faster than 85%. Sorting + SortedList + Binary Search.....
\nfrom sortedcontainers import SortedList\nclass Solution:\n    def closestRoom(self, rooms: List[List[int]], queries: List[List[int]]) -> List[int]:\n        q
```\nfrom sortedcontainers import SortedList\nclass Solution:\n    def closestRoom(self, rooms: List[List[int]], queries: List[List[int]]) -> List[int]:\n        queries=[queries[i]+[i] for i in range(len(queries))]\n        queries.sort(key=lambda i:i[1],reverse=True)\n        rooms.sort(key=lambda i:i[1],reverse=True)\n        res=[-1 for i in range(len(queries))]\n        x=SortedList()\n        for a,b,c in queries:\n            while rooms and rooms[0][1]>=b:\n                x.add(rooms.pop(0)[0])\n            i=x.bisect_left(a)\n            if i<len(x):\n                res[c]=x[i]\n            if x and i!=0:\n                if res[c]==-1 or a-x[i-1]<=x[i]-a:\n                    res[c]=x[i-1]\n        return res\n```
[]