Find the k closest points to origin.
O(n log k)
O(k)
def kClosest(points, k): minHeap = [] for x, y in points: dist = (x ** 2) + (y ** 2) minHeap.append((dist, x, y)) heapq.heapify(minHeap) res = [] for _ in range(k): _, x, y = heapq.heappop(minHeap) res.append([x, y]) return res