求坐标中距离原点最近的几个点，包含二维vector遍历（下标遍历）

最新推荐文章于 2023-09-05 22:14:26 发布

困难·电脑

最新推荐文章于 2023-09-05 22:14:26 发布

阅读量388

点赞数

文章标签： c++

本文链接：https://blog.csdn.net/qq_45848768/article/details/109582225

版权

#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
vector<vector<int>> kClosest(vector<vector<int>>& points, int K)
{
    sort(points.begin(), points.end(), [](const vector<int>& u, const vector<int>& v) {
        return u[0] * u[0] + u[1] * u[1] < v[0] * v[0] + v[1] * v[1];
        });
    return { points.begin(), points.begin() + K };
}
int main()
{   
    vector<vector<int>>a = { {1,2},{3,4},{5,6} };
    vector<vector<int>>answer;
    answer = kClosest(a, 2);
    for (int i = 0; i < answer.size(); i++)
    {
        for (int j = 0; j < answer[0].size(); j++)
        {
            cout << answer[i][j] << " ";
        }
        cout << endl;
    }
}