题解 | #整型数组合并#

#include <iostream>
#include <map>
using namespace std;

int main() {
    int n1,n2,num;
    cin >> n1;
    map<int,int> hashMap;
    while (n1--){
        cin >> num;
        auto it = hashMap.find(num);
        if (it == hashMap.end()){
            hashMap[num] = 1;
        }
    } 
    cin >> n2;
    while (n2--){
        cin >> num;
        auto it = hashMap.find(num);
        if (it == hashMap.end()){
            hashMap[num] = 1;
        }
    }

    map<int,int>::iterator it;
    for (it = hashMap.begin(); it != hashMap.end(); it++){
        cout << it->first;
    }

    return 0;
}