LeetCode contest 119 第一题 973. K Closest Points to Origin

题目：

We have a list of points on the plane.  Find the K closest points to the origin (0, 0).

(Here, the distance between two points on a plane is the Euclidean distance.)

You may return the answer in any order.  The answer is guaranteed to be unique (except for the order that it is in.)

Example 1:

Input: points = [[1,3],[-2,2]], K = 1
Output: [[-2,2]]
Explanation: 
The distance between (1, 3) and the origin is sqrt(10).
The distance between (-2, 2) and the origin is sqrt(8).
Since sqrt(8) < sqrt(10), (-2, 2) is closer to the origin.
We only want the closest K = 1 points from the origin, so the answer is just [[-2,2]].

Example 2:

Input: points = [[3,3],[5,-1],[-2,4]], K = 2
Output: [[3,3],[-2,4]]
(The answer [[-2,4],[3,3]] would also be accepted.)

第一题都是最后时间快到了才交的，我好菜啊Orz。

思路就是平方和算出来，排个序，然后取出前面K个。这一题我主要碰到两个问题，一个是find函数的自定义bool函数，直接添加在solution的class里会报错，没搞懂为什么，然后就改成了用object来比较就成功了。还有一个问题是我自己傻了把vector<vector>的第一个元素当成维度0和1，第二个元素来存内容，和题目相反最后还要全部改回来QAQ。

代码：

struct myclass{
    bool operator()(pair<int,int> x, pair<int,int> y){
        return (x.first < y.first);
    }
} myobject;
class Solution {
public:
    vector<vector<int>> kClosest(vector<vector<int>>& points, int K) {
        vector<vector<int> > re;
        vector<pair<int,int> > com;
        for(int i = 0; i < points.size(); i ++){
            int c = points[i][0]*points[i][0] + points[i][1]*points[i][1];
            pair<int,int> x;
            x=make_pair(c,i);
            com.push_back(x);
        }
        sort(com.begin(),com.end(),myobject);
        int k = com[K-1].second;
        vector<int> x;
        x.push_back(points[k][0]);
        x.push_back(points[k][1]);
        re.push_back(x);
        K --;
        while(K>0){
            vector<int> y;
            y.push_back(points[com[K-1].second][0]);
            y.push_back(points[com[K-1].second][1]);
            K --;
            re.push_back(y);
        }
        
        return re;
    }
};