Given K sorted arrays arranged in the form of a matrix. The task is to merge them. You need to complete mergeKArrays() function which takes 2 arguments, an arr[k][k] 2D Matrix containing k sorted arrays and an integer k denoting the number of sorted arrays. The function should return a pointer to the merged sorted arrays.
Input:
The first line of input contains the number of test cases, then T test cases follow. Each test case will contain an integer K denoting the number of sorted arrays(each with size K). Then in the next line contains all the elements of the array separated by space.
Output:
The output will be the sorted merged array.
User Task:
The task is to complete the function mergeKArrays() which takes two arguments and returns a pointer to the modified array.
Constraints:
1 <= T <= 50
1 <= K <= 100
Example:
Input:
1
3
1 2 3 4 5 6 7 8 9
Output:
1 2 3 4 5 6 7 8 9
Explanation:
Testcase 1:
Above test case has 3 sorted arrays of size 3, 3, 3
arr[][] = [[1, 2, 3],
[4, 5, 6],
[7, 8, 9]]
The merged list will be [1, 2, 3, 4, 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.
| saiujwal13083 | 339 |
| isiddhisingh | 252 |
| Abhishek_Jadhav | 241 |
| _uncle_sam_ | 202 |
| rathiarpit29 | 200 |
| saiujwal13083 | 602 |
| SumitSingh27 | 466 |
| c_ocoooo | 435 |
| rathiarpit29 | 367 |
| NaveenKumarNakka | 362 |
| blackshadows | 5362 |
| Ibrahim Nash | 5242 |
| akhayrutdinov | 5111 |
| mb1973 | 4931 |
| Quandray | 4598 |