<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 {
    bool compare(int a, int b, int x) {
        if (abs(a - x) == abs(b - x)) {
            return a < b;
        }

        return abs(a - x) < abs(b - x);
    }
public:
    vector<int> findClosestElements(vector<int>& arr, int k, int x) {
        int b = 0, e = arr.size() - 1;
        int idx = -1;
        while (b <= e) {
            int mid = (b + e)/2;

            if (arr[mid] <= x) {
                idx = mid;
                b = mid + 1;
            } else {
                e = mid - 1;
            }
        }

        int i = idx, j = idx + 1;

        vector<int> smaller, greater, res;
        while (smaller.size() + greater.size() < k && i >= 0 && j < arr.size()) {
            if (compare(arr[i], arr[j], x)) {
                smaller.push_back(arr[i]);
                i--;
            } else {
                greater.push_back(arr[j]);
                j++;
            }
        }

        while (smaller.size() + greater.size() < k && i >= 0) {
            smaller.push_back(arr[i]);
            i--;
        }

        while (smaller.size() + greater.size() < k && j < arr.size()) {
            greater.push_back(arr[j]);
            j++;
        }

        for (int i = smaller.size() - 1; i >= 0; i--) {
            res.push_back(smaller[i]);
        }

        for (int i = 0; i < greater.size(); i++) {
            res.push_back(greater[i]);
        }

        return res;
    }
};
35900