题解 | 整型数组合并

#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

int main() {
    int m, n;

    cin >> m;

    vector<int> arr_m;
    int k;

    for (int i = 0; i < m; i++) {
        cin >> k;
        if (find(arr_m.begin(), arr_m.end(), k) == arr_m.end())
            arr_m.push_back(k);
    }


    cin >> n;

    for (int i = 0; i < n; i++) {
        cin >> k;

        if (find(arr_m.begin(), arr_m.end(), k) == arr_m.end()) {
            arr_m.push_back(k);
        }
    }

    sort(arr_m.begin(), arr_m.end());
    for (auto i : arr_m) {
        cout << i;
    }
    cout << endl;

    return 0;
}