<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>& nums, int k, int x) {
        vector<int> res;
        int n = nums.size();

        // Edge case: x is smaller than the smallest element in nums
        if (x <= nums[0]) {
            for (int i = 0; i < k; ++i) {
                res.push_back(nums[i]);
            }
            return res;
        }

        // Edge case: x is larger than the largest element in nums
        if (x >= nums[n - 1]) {
            for (int i = n - k; i < n; ++i) {
                res.push_back(nums[i]);
            }
            return res;
        }

        // Two-pointer approach to find the k closest elements
        int l = 0;
        int r = n - 1;

        // Narrow down the window of closest k elements
        while (r - l >= k) {
            if (abs(nums[l] - x) > abs(nums[r] - x)) {
                l++;
            } else {
                r--;
            }
        }

        // Collect the result from the narrowed range
        for (int i = l; i <= r; ++i) {
            res.push_back(nums[i]);
        }

        return res;
    }
};

34300