Set Operations (std::set_intersection)

Problem Statement

Input Format

Line 1: N1. Line 2: N1 sorted integers. Line 3: N2. Line 4: N2 sorted integers.

Output Format

Print intersection elements separated by a space.

Constraints

1 <= N1, N2 <= 500

Sample Input

4
1 2 3 4
3
2 4 6

Sample Output

2 4

Explanation

Computes the common elements between two sorted ranges efficiently.

Starter Code

#include <iostream>
#include <vector>
#include <algorithm>

int main() {
    int n1, n2;
    if (std::cin >> n1) {
        std::vector<int> v1(n1);
        for (int i = 0; i < n1; i++) std::cin >> v1[i];
        if (std::cin >> n2) {
            std::vector<int> v2(n2);
            for (int i = 0; i < n2; i++) std::cin >> v2[i];

            // Write your std::set_intersection logic here

        }
    }
    return 0;
}

Limits

• Time Limit: 1s
• Memory Limit: 256MB