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

using namespace std;

vector<int> getUnion(const vector<int>& arr1, const vector<int>& arr2) {
    unordered_set<int> unionSet(arr1.begin(), arr1.end()); // Insert all elements of arr1

    for (int num : arr2) { // Insert elements of arr2
        unionSet.insert(num);
    }

    vector<int> result(unionSet.begin(), unionSet.end()); // Convert set to vector

    sort(result.begin(), result.end()); // Sort the vector

    return result;
}

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

    vector<int> unionResult = getUnion(arr1, arr2);

    cout << "Union of the arrays (sorted): ";
    for (int num : unionResult) {
        cout << num << " ";
    }
    cout << endl;

    return 0;
}