Problem
Given an array, an integer X, and K, print the K numbers closest to X (absolute difference), in increasing order. If ties, pick the smaller number.
Input format
Input
input.txt
- The first line contains N, X, K (1 ≤ N ≤ 100, 1 ≤ K ≤ N). - The second line contains N integers (-1000 ≤ Ai ≤ 1000).
Output format
Output
output.txt
- K integers, sorted in increasing order.
Example
input
5 4 3 1 2 4 6 8
output
2 4 6
💬 Discussion
Loading...💬
No comments yet. Be the first to start the discussion!
💻 No output yet.
Click Run in the editor to execute your code with the custom input.
Sample cases (from the problem)
Sample Case 1
Input
5 4 3 1 2 4 6 8
Expected output
2 4 6
Solve it your way first
Community solutions unlock after you submit a passing solution. Don't peek.
Ready to solve this challenge?
Create a free account to write code, submit solutions, and track your progress.
⌨️ Keyboard Shortcuts
Code Editor
Run Code
Ctrl
Enter
Submit Code
Ctrl
Shift
Enter
Format Code
Shift
Alt
F
Toggle Comment
Ctrl
/
Undo
Ctrl
Z
Redo
Ctrl
Y
Navigation
Global Search
/
Show Shortcuts
?
Close Modal
Esc