<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();
        vector<int> ans(k);
        if(x<arr[0]){
            for(int i=0;i<k;i++){
                ans[i]=arr[i];
            }
            return ans;
        }
        if(x>arr[n-1]){
            int i=n-1;
            int j=k-1;
            while(j>=0){
                ans[j]=arr[i];
                i--;
                j--;
            } 
            return ans;
        }
        int lo=0;
        int hi=n-1;
        bool flag =false ;
        int t=0;
        int mid=-1;
        while (lo<=hi){
        mid=lo+(hi-lo)/2;
        if(arr[mid]==x){
            flag=true;
            ans[t]=arr[mid];
            t++;
            break;
        }
        else if(arr[mid]>x) hi=mid-1;
        else lo = mid+1;
        }
        int lb=hi;
        int ub=lo;
        if(flag==true){
            lb=mid-1;
            ub=mid+1;
        }
        while (t<k && lb>=0 && ub<=n-1){
            int d1= abs(x-arr[lb]);
             int d2= abs(x-arr[ub]);
             if(d1<=d2){
                ans[t] = arr[lb];
                lb--;
            }
        else {
             ans[t] = arr[ub];
                ub++;  
         }
          t++;
         }
        if(lb<0){
            while(t<k){
                ans[t]=arr[ub];
                ub++;
                t++;
            }
        }
        if(ub>n-1){
            while(t<k){
                ans[t]=arr[lb];
                lb--;
                t++;
            }
        }
        sort(ans.begin(),ans.end());
        return ans;
   

    }
};
34500