<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:
    int find_closest_index(vector<int>& arr, int x) {
        int low = 0;
        int high = arr.size()-1;

        while (low < high) {
            int mid = low + (high-low) / 2;
            if (arr[mid] > x) {
                high = mid;
            } else if (arr[mid] < x) {
                low = mid+1;
            } else {
                return mid;
            }
        }

        return low;
    }

    vector<int> findClosestElements(vector<int>& arr, int k, int x) {
        int closest = find_closest_index(arr, x);

        std::deque<int> closest_k;
        for (int i=std::max(closest-k, 0); i<closest; ++i) {
            closest_k.push_back(arr[i]);
        }

        for (int i=closest; i<std::min(closest+k, (int)arr.size()); ++i) {
            closest_k.push_back(arr[i]);
        }

        while (closest_k.size() > k) {
            auto front = closest_k.front();
            auto back = closest_k.back();
            if (abs(x - front) <= abs(back - x)) {
                closest_k.pop_back();
            } else {
                closest_k.pop_front();
            }
        }

        return std::vector<int>(closest_k.begin(), closest_k.end());
    }
};
34800