Union

Medium Arrays

Solve in Playground →

Problem Statement

Write a C++ program that reads two sorted arrays and finds their union (combined unique elements in sorted order).

Input Format

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

Output Format

Print union elements separated by a space.

Constraints

1 <= N1, N2 <= 500

Sample Input

Sample Output

1 2 3 5 6

Explanation

Combines two sorted arrays, skipping duplicates to form the union.

Starter Code

#include <iostream>
#include <vector>

int main() {
    int n1, n2;
    if (std::cin >> n1) {
        std::vector<int> a(n1);
        for (int i = 0; i < n1; i++) std::cin >> a[i];
        if (std::cin >> n2) {
            std::vector<int> b(n2);
            for (int i = 0; i < n2; i++) std::cin >> b[i];
            // Write your code here
        }
    }
    return 0;
}

Limits

Time Limit: 1s
Memory Limit: 256MB

Start Coding in IDE →