ragbachu
diff --git a/‎Easy/K Closest Points to Origin.java
Lines changed: 0 additions & 36 deletions b/‎Easy/K Closest Points to Origin.java
Lines changed: 0 additions & 36 deletions
diff --git a/‎Medium/K Closest Points to Origin.java
Lines changed: 15 additions & 0 deletions b/‎Medium/K Closest Points to Origin.java
Lines changed: 15 additions & 0 deletions
@@ -0,0 +1,15 @@
+class Solution {
+  public int[][] kClosest(int[][] points, int k) {
+    PriorityQueue<int[]> pq = new PriorityQueue<>((o1, o2) -> {
+      double diff =  Math.sqrt(o1[0] * o1[0] + o1[1] * o1[1]) - Math.sqrt(
+          o2[0] * o2[0] + o2[1] * o2[1]);
+      return diff < 0 ? -1 : (diff > 0 ? 1 : 0);
+    });
+    Collections.addAll(pq, points);
+    int[][] result = new int[k][2];
+    for (int i = 0; i < k; i++) {
+      result[i] = pq.poll();
+    }
+    return result;
+  }
+}