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

using namespace std;

vector<int> unionSorted(const vector<int>& arr1, const vector<int>& arr2) {
    set<int> combined; // Using a set to avoid duplicates and sort automatically

    // Insert elements from both arrays into the set
    combined.insert(arr1.begin(), arr1.end());
    combined.insert(arr2.begin(), arr2.end());

    // Convert the set back to a vector
    vector<int> sortedUnion(combined.begin(), combined.end());
    return sortedUnion;
}

int main() {
    vector<int> arr1 = {4, 8, 2, 6};
    vector<int> arr2 = {4, 5, 9, 1, 5, 3, 7};

    vector<int> result = unionSorted(arr1, arr2);

    // Output the result
    for (int num : result) {
        cout << num << " ";
    }
    cout << endl;

    return 0;
}