Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- class Solution {
- public:
- vector<vector<int>> kClosest(vector<vector<int>>& points, int K) {
- sort(points.begin(), points.end(), [](vector<int>& a, vector<int>& b) {
- return a[0] * a[0] + a[1] * a[1] < b[0] * b[0] + b[1] * b[1];
- });
- return vector<vector<int>>(points.begin(), points.begin() + K);
- }
- };
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement