Find K Closest Elements

Given a sorted integer array and a target value x, return the k integers closest to x in ascending order. Ties are broken by preferring the smaller value. Use the sorted property to locate the optimal contiguous window of size k efficiently, for example via binary search on the window start or a two-pointer shrinking approach.