add cpp solution

jinshendan · jinshendan · commit f7f14a03d014 · 2020-05-30T09:18:10.000+02:00
diff --git a/May-LeetCoding-Challenge/30-K-Closest-Points-To-Origin/K-Closest-Points-To-Origin.cpp b/May-LeetCoding-Challenge/30-K-Closest-Points-To-Origin/K-Closest-Points-To-Origin.cpp
@@ -0,0 +1,32 @@
+class Solution {
+public:
+    struct T {
+        int x, y, d;
+        T(){}
+        T(int x, int y): x(x), y(y){d = x * x + y * y;}
+        bool operator < (const T& tmp) const {
+            return d < tmp.d;
+        }
+    };
+    vector<vector<int>> kClosest(vector<vector<int>>& points, int K) {
+        priority_queue<T> q;
+        for (int i = 0; i < points.size(); i++){
+            if (q.size() == K){
+                if (q.top().d > points[i][0] * points[i][0] + points[i][1] * points[i][1]) {
+                    q.pop();
+                    q.push(T(points[i][0], points[i][1]));
+                }
+            }
+            else 
+                q.push(T(points[i][0], points[i][1]));
+        }
+                
+        vector<vector<int>> ans;
+        while(!q.empty()){
+            vector<int> v = {q.top().x, q.top().y};
+            ans.push_back(v);
+            q.pop();
+        }
+        return ans;
+    }
+};
