<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 findIndex(vector<int>& arr, int x)
    {
        //if(x <= arr[0])
        //    return 0;
        //if(x >= arr[arr.size()-1])
        //    return arr.size()-1;
        
        int l = 0, h = arr.size()-1;
        
        while(l <= h)
        {
            int mid = (l + h)/2;
            if(arr[mid] == x)
                return mid;
            if(x > arr[mid])
                l = mid + 1;
            else
                h = mid - 1;
        }
        return l;
    }
    
    vector<int> findClosestElements(vector<int>& arr, int k, int x) 
    {
        int index = findIndex(arr, x);
        
        int i = index-1;
        int j = index;
        
        deque<int> deque;
        vector<int> ans_cp;
        
        while(k-- and (i >= 0 || j <= arr.size()-1) )
        {
            int diff1 = (i >= 0) ? abs(arr[i]-x) : INT_MAX;
            int diff2 = (j <= arr.size()-1) ? abs(arr[j] - x) : INT_MAX;
            
            if(diff1 <= diff2)
                deque.push_front(arr[i--]);
                
            else
                deque.push_back(arr[j++]);
        }
        
        move(begin(deque), end(deque), back_inserter(ans_cp));
        
        return ans_cp;
    }
};
35200