forked from krishna14kant/Data-Structures-
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathmerge.cpp
More file actions
45 lines (41 loc) · 966 Bytes
/
merge.cpp
File metadata and controls
45 lines (41 loc) · 966 Bytes
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
#include <bits/stdc++.h>
using namespace std;
// } Driver Code Ends
//User function template for C++
class Solution{
public:
void merge(int arr1[], int arr2[], int n, int m) {
// code here
int j = 0, i = n-1;
while(j < m && i > -1 && arr2[j] < arr1[i])
swap(arr2[j++],arr1[i--]);
sort(arr1,arr1+n);
sort(arr2,arr2+m);
}
};
// { Driver Code Starts.
int main() {
int t;
cin >> t;
while (t--) {
int n, m, i;
cin >> n >> m;
int arr1[n], arr2[m];
for (i = 0; i < n; i++) {
cin >> arr1[i];
}
for (i = 0; i < m; i++) {
cin >> arr2[i];
}
Solution ob;
ob.merge(arr1, arr2, n, m);
for (i = 0; i < n; i++) {
cout << arr1[i] << " ";
}
for (i = 0; i < m; i++) {
cout << arr2[i] << " ";
}
cout << "\n";
}
return 0;
} // } Driver Code Ends