lc 973.middle 最接近原点的 K 个点（***自定义sort比较函数）

评论https://leetcode-cn.com/problems/k-closest-points-to-origin/comments/659297

自定义compare函数https://leetcode-cn.com/problems/k-closest-points-to-origin/solution/sortzi-ding-yi-pai-xu-by-heroding/

bool compare(vector<int>& a, vector<int> &b){
        return a[0]*a[0]+a[1]*a[1] < b[0]*b[0]+b[1]*b[1];
}

class Solution {
public:
    vector<vector<int>> kClosest(vector<vector<int>>& points, int K) {
        vector<vector<int>> ans;
        sort(points.begin(),points.end(),compare);
        for(int i=0;i<K;++i)
            ans.push_back(points[i]);
        return ans;
    }
};