<p>Given a <strong>sorted</strong> integer array <code>arr</code>, two integers <code>k</code> and <code>x</code>, return the <code>k</code> closest integers to <code>x</code> in the array. The result should also be sorted in ascending order.</p>

<p>An integer <code>a</code> is closer to <code>x</code> than an integer <code>b</code> if:</p>

<ul>
	<li><code>|a - x| &lt; |b - x|</code>, or</li>
	<li><code>|a - x| == |b - x|</code> and <code>a &lt; b</code></li>
</ul>

<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>
<pre><strong>Input:</strong> arr = [1,2,3,4,5], k = 4, x = 3
<strong>Output:</strong> [1,2,3,4]
</pre><p><strong class="example">Example 2:</strong></p>
<pre><strong>Input:</strong> arr = [1,2,3,4,5], k = 4, x = -1
<strong>Output:</strong> [1,2,3,4]
</pre>
<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>

<ul>
	<li><code>1 &lt;= k &lt;= arr.length</code></li>
	<li><code>1 &lt;= arr.length &lt;= 10<sup>4</sup></code></li>
	<li><code>arr</code> is sorted in <strong>ascending</strong> order.</li>
	<li><code>-10<sup>4</sup> &lt;= arr[i], x &lt;= 10<sup>4</sup></code></li>
</ul>


class Solution {

public:

    priority_queue<pair<int, int>, vector<pair<int, int>>, greater<pair<int, int>>> diffQ;
    priority_queue<int, vector<int>, greater<int> > resultQ;


    vector<int> findClosestElements(vector<int>& arr, int k, int x) 
    {
        vector<int> result;

        int idx = 0;
        int min = INT_MAX;
        for( int i=0; i < arr.size(); ++i )
        {
            if( min > abs(arr[i] - x) ) {
                min = abs(arr[i] - x);
                idx = i;
            }
        }

        // go k steps both sides, from this place.

        int i = idx;
        while( i >= 0 && i >= idx-k )
        {
            diffQ.push( {abs(arr[i] -  x), arr[i]} );
            --i;
        }

        i = idx+1;
        while( i < arr.size() && i <= idx + k )
        {
            diffQ.push( {abs(arr[i] -  x), arr[i]} );
            ++i;
        }

        i = 0;
        while( i < k && diffQ.size() )
        {
            resultQ.push( diffQ.top().second );
            diffQ.pop();
            ++i;
        }

        while( resultQ.size() )
        {
            result.push_back(resultQ.top() );
            resultQ.pop();
        }

        return result;
    }
};
40200