K closest Points to Origin

/*
We have a list of points on the plane.  Find the K closest points to the origin (0, 0).

(Here, the distance between two points on a plane is the Euclidean distance.)

You may return the answer in any order.  The answer is guaranteed to be unique (except for the order that it is in.)



Example 1:

Input: points = [[1,3],[-2,2]], K = 1
Output: [[-2,2]]
Explanation:
The distance between (1, 3) and the origin is sqrt(10).
The distance between (-2, 2) and the origin is sqrt(8).
Since sqrt(8) < sqrt(10), (-2, 2) is closer to the origin.
We only want the closest K = 1 points from the origin, so the answer is just [[-2,2]].
Example 2:

Input: points = [[3,3],[5,-1],[-2,4]], K = 2
Output: [[3,3],[-2,4]]
(The answer [[-2,4],[3,3]] would also be accepted.)


Note:

1 <= K <= points.length <= 10000
-10000 < points[i][0] < 10000
-10000 < points[i][1] < 10000
*/

import java.util.*;


public class KClosestPointstoOrigin{

public static int[][] getKClosest(int[][] points, int k){
//store points to a min heap
PriorityQueue<int[]> pq = new PriorityQueue<>(new Comparator<int[]>(){
@Override
public int compare(int[] p1, int[] p2){
return Integer.compare(p2[0]*p2[0] + p2[1]*p2[1], p1[0]*p1[0] + p1[1]*p1[1]);
}});


for(int[] point:points){
if(pq.size()<k){
pq.offer(point);
}else{
pq.offer(point);
pq.poll();
}
}
int[][] res = new int[k][2];
int index=0;
while(!pq.isEmpty()){
res[index++] = pq.poll();
}
return res;
}

public static void main(String[] args){
int[][] points = new int[][] {{3,3},{5,-1},{-2,4},{1,1}, {1,0}};
int k = 2;
int[][] res = getKClosest(points, k);
for(int[] point:res){
System.out.println(Arrays.toString(point));
}
}
}