Given two sorted arrays P and Q in non-decreasing order with size X and Y. The task is to merge the two sorted arrays into one sorted array (in non-decreasing order).
Note: Expected time complexity is O((X+Y) log(X+Y)). DO NOT use extra space.
First line contains an integer T, denoting the number of test cases. First line of each test case contains two space separated integers X and Y, denoting the size of the two sorted arrays. Second line of each test case contains X space separated integers, denoting the first sorted array P. Third line of each test case contains Y space separated integers, denoting the second array Q.
For each test case, print (X + Y) space separated integer representing the merged array.
1 <= T <= 100
1 <= X, Y <= 5*104
0 <= Pi, Qi <= 109
1 3 5 7
0 2 6 8 9
0 1 2 3 5 6 7 8 9
Testcase 1: After merging two non-decreasing arrays, we have, 0 1 2 3 5 6 7 8 9.
If you have purchased any course from GeeksforGeeks then please ask your doubt on course discussion forum. You will get quick replies from GFG Moderators there.