Problem
Given two sorted arrays A and B of sizes N and M, find the Kth smallest element in the merged array using recursion (1-based indexing).
Input format
Input
input.txt
- The first line contains three integers N, M, K (1 ≤ K ≤ N+M ≤ 100) - The second line contains N integers, sorted - The third line contains M integers, sorted
Output format
Output
output.txt
- The Kth element of the merged array
Example
input
3 3 4 1 3 5 2 4 6
output
4
💬 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
3 3 4 1 3 5 2 4 6
Expected output
4
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