Problem
Given two sorted arrays, merge them into one sorted array using dynamic memory allocation.
Input (from file `input.txt`):
- First line: integer N
- Second line: N sorted integers
- Third line: integer M
- Fourth line: M sorted integers
Output (to file `output.txt`):
- N+M sorted integers
Example
input.txt:
3
1 3 5
3
2 4 6
output.txt:
1 2 3 4 5 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)
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