<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 less=-1, greater=-1, cnt=0;
        vector<int> v(20001, 0), ans;

        for(int i=0; i<arr.size(); i++) {
            if(arr[i]<=x) less=i;
            else if(arr[i]>x && greater==-1) greater=i;
        }

        while(cnt<k) {
            if(less<0) {
                cnt++;
                //ans.push_back(arr[greater]);
                v[(arr[greater]+10000)]++;
                greater++;
            }
            else if(greater>=arr.size()) {
                cnt++;
                //ans.push_back(arr[less]);
                v[(arr[less]+10000)]++;
                less--;
            }
            else {
                if(x-arr[less]>arr[greater]-x) {
                    cnt++;
                    //ans.push_back(arr[greater]);
                    v[(arr[greater]+10000)]++;
                    greater++;
                }
                else {
                    cnt++;
                    //ans.push_back(arr[less]);
                    v[(arr[less]+10000)]++;
                    less--;
                } 
            }
        }

        for(int i=0; i<20001; i++) for( int j=0; j<v[i]; j++) ans.push_back(i-10000);
        //sort(ans.begin(), ans.end());
        return ans;
    }
};
41200