C++ operator重载

priority_queue<vector<int>, vector<vector<int>>,cmp1> q; 

struct cmp1
{
    bool operator()(vector<int> &x, vector<int> &y)
    {
        // return pow(x[0], 2) + pow(x[1], 2) < pow(y[0], 2) + pow(y[1], 2);//小的优先级高
        return x[0]*x[0] + x[1]*x[1] < y[0]*y[0] + y[1]*y[1];//小的优先级高

    }
};


priority_queue<vector<int>, vector<vector<int>>,cmp1> q;
        for (int i=0; i<points.size(); i++) {
            q.push(points[i]);

            if (q.size() > K) {
                q.pop();
            }
        }

sort(points.begin(), points.end(), [](vector<int> &a, vector<int> &b){ return a[2] < b[2]; });

sort(points.begin(), points.end(), [](vector<int> &a, vector<int> &b){ return a[2] < b[2]; });