K Closest Points to Origin Python Solution

lcpy gen -n 973   # by problem number
lcpy gen -s k_closest_points_to_origin   # by problem name

Input: points = [[1,3],[-2,2]], k = 1
Output: [[-2,2]]

Input: points = [[3,3],[5,-1],[-2,4]], k = 2
Output: [[3,3],[-2,4]]

import heapq


class Solution:
    # Time: O(n log k)
    # Space: O(k)
    def k_closest(self, points: list[list[int]], k: int) -> list[list[int]]:
        heap: list[tuple[int, list[int]]] = []

        for x, y in points:
            dist = x * x + y * y
            heapq.heappush(heap, (-dist, [x, y]))
            if len(heap) > k:
                heapq.heappop(heap)

        return [point for _, point in heap]