<p>Given an array of <code>points</code> where <code>points[i] = [x<sub>i</sub>, y<sub>i</sub>]</code> represents a point on the <strong>X-Y</strong> plane and an integer <code>k</code>, return the <code>k</code> closest points to the origin <code>(0, 0)</code>.</p>

<p>The distance between two points on the <strong>X-Y</strong> plane is the Euclidean distance (i.e., <code>&radic;(x<sub>1</sub> - x<sub>2</sub>)<sup>2</sup> + (y<sub>1</sub> - y<sub>2</sub>)<sup>2</sup></code>).</p>

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

<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>
<img alt="" src="https://assets.leetcode.com/uploads/2021/03/03/closestplane1.jpg" style="width: 400px; height: 400px;" />
<pre>
<strong>Input:</strong> points = [[1,3],[-2,2]], k = 1
<strong>Output:</strong> [[-2,2]]
<strong>Explanation:</strong>
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) &lt; 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]].
</pre>

<p><strong class="example">Example 2:</strong></p>

<pre>
<strong>Input:</strong> points = [[3,3],[5,-1],[-2,4]], k = 2
<strong>Output:</strong> [[3,3],[-2,4]]
<strong>Explanation:</strong> The answer [[-2,4],[3,3]] would also be accepted.
</pre>

<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>

<ul>
	<li><code>1 &lt;= k &lt;= points.length &lt;= 10<sup>4</sup></code></li>
	<li><code>-10<sup>4</sup> &lt;= x<sub>i</sub>, y<sub>i</sub> &lt;= 10<sup>4</sup></code></li>
</ul>

#include <iostream>

class Solution {
public:
    vector<vector<int>> kClosest(vector<vector<int>>& points, int k) {
        vector<vector<int>> answer;
        vector<float> distances;
        std::unordered_map<float, vector<vector<int>> > map;

        for (int i = 0; i < points.size(); i++ ){

            vector<int> point = points[i];

            float distance = sqrt( pow( point[0] , 2 ) + pow( point[1], 2 ) );
 

            if ( map.contains(distance) )
            {
                std::cout << "is true" << std::endl;
                map[distance].push_back(point);
            }
            else 
            {
                std::cout << "blas"<<std::endl;
                vector<vector<int>> pointHolder;
                pointHolder.push_back(point);
                map.insert( make_pair(distance, pointHolder) );
                distances.push_back(distance);
            }

        }

        sort(distances.begin(), distances.end());

        int count = 0;
        int track = 0;

        while ( count < k )
        {
            float distance = distances[track];
            auto vect = map[distance];

            for ( int j = 0; j < vect.size(); j++)
            {
                answer.push_back( vect[j] );
                count++;
            } 
            track++;
        }

        if ( answer.size() > k)
        {
            return {answer[0]};
        }

        return answer;
    }
};
119950