Dynamic Array Problem-2 Solved

Author: MohammadFahad1

dynamic_array_problem-2.cpp

@@ -0,0 +1,40 @@
+#include <bits/stdc++.h>
+using namespace std;
+
+int main()
+{
+    int n, m;
+
+    cin >> n;
+
+    int *a = new int[n];
+
+    for (int i = 0; i < n; i++)
+    {
+        cin >> a[i];
+    }
+
+    cin >> m;
+
+    int *b = new int[m];
+
+    for (int i = 0; i < n; i++)
+    {
+        b[i] = a[i];
+    }
+
+    delete[] a;
+
+    for (int i = n; i < m; i++)
+    {
+        cin >> b[i];
+    }
+    cout << endl;
+
+    for (int i = 0; i < m; i++)
+    {
+        cout << b[i] << " ";
+    }
+
+    return 0;
+}

dynamic_array_problem-2.exe

@@ -1,2 +1,4 @@
 5
-30 50 10 20 40
+1 2 3 4 5
+10
+6 7 8 9 10

input.txt

@@ -1 +1,2 @@
-30 50 10 20 40 
+
+1 2 3 4 5 6 7 8 9 10