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.
Input:
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.
Output:
For each test case, print (X + Y) space separated integer representing the merged array.
Constraints:
1 <= T <= 100
1 <= X, Y <= 5*104
0 <= Pi, Qi <= 109
Example:
Input:
1
4 5
1 3 5 7
0 2 6 8 9
Output:
0 1 2 3 5 6 7 8 9
Explanation:
Testcase 1: After merging two non-decreasing arrays, we have, 0 1 2 3 5 6 7 8 9.
| mohamadhegazy97 | 57 |
| ManojBharadhwaj | 49 |
| bhatabhi554 | 48 |
| adityak12 | 48 |
| RaghavJindal | 47 |
| blackshadows | 940 |
| SunkyuHwang | 794 |
| bently_nixon | 701 |
| mb1973 | 491 |
| Shaurya Khanna | 491 |
| akhayrutdinov | 5043 |
| Ibrahim Nash | 4967 |
| blackshadows | 4640 |
| Quandray | 4354 |
| sanjay05 | 3668 |