Nu ar trebui sa copiezi exercitiile, ai mai dat si 1200 lei la WellCode, macar invata ceva din codul asta:
#include<iostream>
using namespace std;
int main() {
long int arr1Length, lostElements;
cin >> arr1Length >> lostElements;
long int arr1[arr1Length];
for (long int i = 0; i < arr1Length; i++) {
cin >> arr1[i];
}
long int arr2Length = arr1Length - lostElements;
long int arr2[arr2Length];
for (long int i = 0; i < arr2Length; i++) {
cin >> arr2[i];
}
if (lostElements == 0) {
cout << "Nu s-au pierdut date";
}
else {
for (long int i = 0; i < arr1Length && arr2Length; ++i) {
int j = 0, lostElement = 0;
for (; j < arr2Length; j++) {//1 1
if (arr1[i] == arr2[j]) {
lostElement = 1;
break;
}
}
if (lostElement == 1) {
for (int h = j; h < arr2Length - 1; h++) {
arr2[h] = arr2[h + 1];
}
arr2Length--;
for (int h = i; h < arr1Length - 1; h++) {
arr1[h] = arr1[h + 1];
}
arr1Length--;
i--;
}
}
for (int i = 0; i < arr1Length; ++i) {
cout << arr1[i] << ' ';
}
}
return 0;
}
