K Closest Points to Origin

Problem Link: https://leetcode.com/problems/k-closest-points-to-origin/

import heapq
class Solution:
    def kClosest(self, points: List[List[int]], k: int) -> List[List[int]]:
        
        minheap=[]
        heapq.heapify(minheap)
        for x,y in points:  
            dist=(x*x)+(y*y)
            heapq.heappush(minheap,[dist,x,y])
        
        ans=[]
        while(k>0):
            dist,x,y=heapq.heappop(minheap)
            ans.append([x,y])
            k-=1
        
        return ans