Create Solution2.cpp

solution/0900-0999/0973.K Closest Points to Origin/Solution2.cpp

@@ -0,0 +1,19 @@
+class Solution {
+public:
+    vector<vector<int>> kClosest(vector<vector<int>>& points, int k) {
+        priority_queue<pair<double, int>> pq;
+        for (int i = 0, n = points.size(); i < n; ++i) {
+            double dist = hypot(points[i][0], points[i][1]);
+            pq.push({dist, i});
+            if (pq.size() > k) {
+                pq.pop();
+            }
+        }
+        vector<vector<int>> ans;
+        while (!pq.empty()) {
+            ans.push_back(points[pq.top().second]);
+            pq.pop();
+        }
+        return ans;
+    }
+};