How do you find the k closest points to the origin?

import heapq

def k_closest(points, k):
    heap = []                       # max-heap via negative distance
    for x, y in points:
        d = x * x + y * y
        heapq.heappush(heap, (-d, [x, y]))
        if len(heap) > k:
            heapq.heappop(heap)     # drop the farthest
    return sorted(p for _, p in heap)


# --- demo ---
print(k_closest([[1, 3], [-2, 2], [5, 8], [0, 1]], 2))   # [[-2, 2], [0, 1]]