You passed through the weekend offer event.

At the first step, you should solve at least 2 of 4 tasks in an online contest platform.

The second interview is an online interview where you should solve 2 algorithmic tasks. The first one is easy, and the second one is more difficult (like medium-level tasks on LeetCode).

The final interview is a classic system design task.

Given:

• An array of sorted integers: a
• An integer: K
• The index of the target element in the array: index

It is necessary to return, in any order, K numbers from the array that are closest in value to the element a[index].

cpp std::vector find_k_closest(const std::vector& a, size_t K, size_t index)

Examples:

• find_k_closest(a={2, 3, 5, 7, 11}, K=2, index=3) -> {5, 7}
• find_k_closest(a={4, 12, 15, 15, 24}, K=3, index=1) -> {12, 15, 15}
• find_k_closest(a={2, 3, 5, 7, 11}, K=2, index=2) -> {3, 5} or {5, 7}