-
Notifications
You must be signed in to change notification settings - Fork 2
/
Merge without extra spaces.cc
78 lines (57 loc) · 1.6 KB
/
Merge without extra spaces.cc
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
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
//{ Driver Code Starts
#include <bits/stdc++.h>
using namespace std;
// } Driver Code Ends
class Solution{
public:
//Function to merge the arrays.
void merge(long long arr1[], long long arr2[], int n, int m)
{
// code here
vector<long long >v1;
// Inserrting 1st Array elements..
for(int i=0 ; i<n ; i++){
v1.push_back(arr1[i]);
}
// Inserting 2nd Array elements..
for(int i=0 ;i<m ; i++){
v1.push_back(arr2[i]);
}
// Sorting the whole Vector elements..
sort(v1.begin() , v1.end());
// Inserting element in 1st Array with size "n" From Vector v1..
for(int i=0 ; i<n ; i++){
arr1[i]= v1[i];
}
// Inserting element in 2nd Array with size "m" From Vector v1..
for(int i=0 ; i<m ; i++){
arr2[i]= v1[n+i];
}
}
};
//{ Driver Code Starts.
int main()
{
int T;
cin >> T;
while(T--){
int n, m;
cin >> n >> m;
long long arr1[n], arr2[m];
for(int i = 0;i<n;i++){
cin >> arr1[i];
}
for(int i = 0;i<m;i++){
cin >> arr2[i];
}
Solution ob;
ob.merge(arr1, arr2, n, m);
for (int i = 0; i < n; i++)
cout<<arr1[i]<<" ";
for (int i = 0; i < m; i++)
cout<<arr2[i]<<" ";
cout<<endl;
}
return 0;
}
// } Driver Code Ends