题解 | #整型数组合并#

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

int main() {
    int a, b;
    cin >> a;
    int arr1[a];
    for(int i =0; i <a; i++){
        cin >> arr1[i];
    }
    cin >> b;
    int arr2[b];
    for(int i =0; i <b; i++){
        cin >> arr2[i];
    }
    int count =0;
    int arr3[a+b];
    for(int i =0;i < a+b; i++){
        if(i <a) arr3[i] =arr1[i];
        if(i >=a) arr3[i] =arr2[i-a];
    }
    sort(arr3, arr3+a+b);
    for(int i =0; i < a+b; i++ ){
        if(arr3[i] !=arr3[i+1]) cout << arr3[i];
    }
    }