<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:
    def findClosestElements(self, arr: List[int], k: int, x: int) -> List[int]:
        if not arr or k == 0:
            return []

        closet_point_idx = self.findClosestElement(arr, x)
        l, r = closet_point_idx - 1, closet_point_idx + 1

        ans = [arr[closet_point_idx]]

        k -= 1

        while k > 0:
            if self.choose_left(arr, l, r, x):
                ans.append(arr[l])
                l -= 1
            else:
                ans.append(arr[r])
                r += 1
            k -= 1
        
        ans.sort()
        return ans



    def choose_left(self, arr, l, r, x):
        if r >= len(arr) or l >= 0 and abs(x - arr[l]) <= abs(arr[r] - x):
            return True
        return False
    
    def findClosestElement(self, arr, x):
        l, r = 0, len(arr) - 1

        while l + 1 < r:
            m = l + (r - l) // 2
            if arr[m] <= x:
                l = m
            else:
                r = m

        return l if abs(x - arr[l]) <= abs(arr[r] - x) else r

18000