Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- using namespace std;
- int main() {
- int n, m;
- cin >> n >> m;
- int arrA[n], arrB[m];
- int indexA = 0;
- int indexB = 0;
- int cnt = 0;
- for (int i = 0; i < n; ++i) {
- cin >> arrA[i];
- }
- for (int i = 0; i < m; ++i) {
- cin >> arrB[i];
- }
- while (indexA < n && indexB < m) {
- if (arrA[indexA] == arrB[indexB]) {
- indexA++;
- indexB++;
- } else if (arrA[indexA] < arrB[indexB]) {
- cnt++;
- indexA++;
- } else {
- cnt++;
- indexB++;
- }
- }
- cout << "Уникальных элементов в последовательности: " << cnt + (n - indexA) + (m - indexB);
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement