<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) {
        int startPos = binarySearch(arr, x, 0, arr.size());
        priority_queue<pair<int, int>, vector<pair<int, int>>, greater<pair<int, int>>> data;
        for (int i = max(0, startPos - k); i < min(int(arr.size()), startPos + k); ++i)
        {
            data.push({abs(arr[i] - x), arr[i]});
        }
        vector<int> result;
        result.reserve(k);
        for (int i = 0; i < k; ++i)
        {
            result.push_back(data.top().second);
            data.pop();
        }
        sort(result.begin(), result.end());
        return result;
    }

    int binarySearch(const vector<int>& data, int x, int start, int end)
    {
        if (start >= end)
            return start;
        
        auto mid = start + (end - start) / 2;
        if ((x == data[mid]) && ((mid == 0) || (x != data[mid - 1])))
            return mid;
        else if (x <= data[mid])
            return binarySearch(data, x, start, mid);
        return binarySearch(data, x, mid + 1, end);
    }
};
38600