Problem
Given two arrays A (size N) and B (size M), rearrange A so that:
- Elements present in B come first, in the order of B (all occurrences).
- Remaining elements are sorted in ascending order at the end.
Input format
Input
input.txt
- The first line contains N and M (1 ≤ N, M ≤ 100). - The second line contains N integers (A). - The third line contains M integers (B).
Output format
Output
output.txt
- The rearranged array A.
Example
input
10 4 2 1 2 5 7 1 9 3 6 8 2 1 8 3
output
2 2 1 1 8 3 5 6 7 9
💬 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
10 4 2 1 2 5 7 1 9 3 6 8 2 1 8 3
Expected output
2 2 1 1 8 3 5 6 7 9
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