<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:
    vector<int> findClosestElements(vector<int> &arr, int k, int x) {

        // Lambda Capture
        auto comprator = [&x](int a, int b) {
            auto p = abs(x - a);
            auto q = abs(x - b);
            if ( p != q ) {
                return p < q;
            }
            return a < b;
        };

        priority_queue<int, vector<int>, decltype(comprator)> maxHeap(comprator);

        for ( auto &i : arr ) {
            if ( maxHeap.size() != k ) {
                maxHeap.push(i);
            }
            else {
                if ( !comprator(maxHeap.top(), i) ) {
                    maxHeap.pop();
                    maxHeap.push(i);
                }
            }
        }
        vector<int> vec;
        vec.reserve(k);
        while ( !maxHeap.empty() ) {
            vec.push_back(maxHeap.top());
            maxHeap.pop();
        }
        sort(vec.begin(), vec.end());
        return vec;
    }
};

36200