华为机试 HJ80题解 | #整型数组合并#

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

int main() {
    int N1, N2;
    vector<int> nums;
    
    while (cin >> N1) { // 注意 while 处理多个 case
        int n1;
        for (int i = 0; i < N1; i++) {
            cin >> n1;
            nums.push_back(n1);
        }
        cin >> N2;
        int n2;
        for (int j = 0; j < N2; j++) {
            cin >> n2;
            nums.push_back(n2);
        }
    }
    unordered_map<int, int> iMap;
    std::sort(nums.begin(), nums.end());
    for (auto num : nums) {
        if (iMap.count(num) == 0) {
            std::cout << num;
            iMap[num]++;
        }
    }
    std::cout << std::endl;
}
// 64 位输出请用 printf("%lld")