原题目: https://leetcode-cn.com/problems/k-closest-points-to-origin/
思路:
采用封装好的nth_element方法
代码:
class Solution {
public:
vector<vector<int>> kClosest(vector<vector<int>>& points, int K) {
nth_element(points.begin(),points.begin()+K,points.end(),[](const vector<int>&v1,const vector<int> &v2){
return v1[0]*v1[0]+v1[1]*v1[1]<v2[0]*v2[0]+v2[1]*v2[1];
});
return vector<vector<int>>(points.begin(),points.begin()+K);
}
};