<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 n = arr.size();
        if (x < arr[0])
            return vector<int>(arr.begin(), arr.begin() + k);
        if (x > arr[n - 1])
            return vector<int>(arr.begin() + n - k, arr.end());

        int idx = binarySearch(arr, x);

        vector<int> ans;
        int l = idx, h = idx + 1;

        while (l >= 0 && h < n && k > 0) {
            int diff1 = abs(arr[l] - x), diff2 = abs(arr[h] - x);
            if (diff1 <= diff2)
                ans.insert(ans.begin(), arr[l--]);
            else
                ans.push_back(arr[h++]);
            k--;
        }

        while (l >= 0 && k > 0) {
            ans.insert(ans.begin(), arr[l--]);
            k--;
        }

        while (h < n && k > 0) {
            ans.push_back(arr[h++]);
            k--;
        }

        return ans;
    }

    int binarySearch(vector<int> arr, int x) {
        int s = 0, e = arr.size() - 1, ans = -1;

        while (s <= e) {
            int mid = s + (e - s) / 2;
            if (arr[mid] == x)
                return mid;
            else if (arr[mid] < x) {
                ans = mid;
                s = mid + 1;
            } else
                e = mid - 1;
        }

        return ans;
    }
};
36900