<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) {
        
        if(arr.size() == 1) return arr;

        int index = bst(arr, x);
        list<int> closest;

        int diffl = 1, diffr = 0;
        while(closest.size() < k){

            if(!check(index + diffr, arr.size()) &&  !check(index - diffl, arr.size())) break;

            if(!check(index-diffl, arr.size())){
                closest.push_back(arr[index + diffr]);
                diffr++;
            } else if(!check(index+diffr, arr.size())){
                closest.push_front(arr[index - diffl]);
                diffl++;
            } else{
                
                int r_value = abs(arr[index + diffr] - x);
                int l_value = abs(arr[index - diffl] - x);

                if(l_value <= r_value){
                    closest.push_front(arr[index - diffl]);
                    diffl++; 
                }else if(l_value > r_value){
                    closest.push_back(arr[index + diffr]);
                    diffr++;   
                }
            }
        }

        return vector(closest.begin(), closest.end());
    }
    bool check(int index, int size){
        return index >= 0 && index < size;
    }

    int bst(vector<int>& arr, int x){

        int size = arr.size(), s = 0;

        while(size>0){

            size /= 2;
            if(s + size >= arr.size()) return arr.size() - 1;
            if(arr[s + size] == x) return s + size;
            if(arr[s + size] < x) {
                s = s + size + 1;
            }
        }

        return s;
    }
};
39500