k_closest_numbers_to_x.py

import heapq as heap

arr = [2, 4, 5, 6, 9]
k = 3
x = 10
maxheap = []
for i in range(k):
    diff = abs(x - arr[i])
    heap.heappush(maxheap, (-1 * diff, arr[i]))
for i in range(k, len(arr)):
    diff = abs(x - arr[i])
    if maxheap[0][0] * -1 > diff:
        heap.heappop(maxheap)
        heap.heappush(maxheap, (-1 * diff, arr[i]))

results = []
while len(maxheap) > 0:
    _, v = heap.heappop(maxheap)
    results.append(v)
print(sorted(results))