Find K Closest Elements (Heaps)

Given a sorted array, a target value $x$, and an integer $k$, find the $k$ closest elements to $x$ in the array. Use a Max-Heap to maintain the $k$ closest elements.