【swust】1037: 集合的并运算的实现

样例：

8

0 5 6 3 8 7 9 10

7

1 3 4 7 8 9 5

#include <iostream>
#include<string.h>
#include<string>
#include<algorithm>
using namespace std;
int main()
{
    int n;
    cin >> n;
    int A[1000];
    int B[1000] ;
    int b[1000] ;
    
    for (int i = 0; i < n; i++)
    {
        cin >> A[i];
        b[A[i]] = 1; //将a[]出现的数的关系存入b[]中,方便后续判断，输出并集
    }
    int m;
    cin >> m;
    for (int i = 0; i < m; i++)
    {
        cin >> B[i];
    }  
    for (int i = 0; i < n; i++)
    {
        cout << A[i] << ' ';
    }
    for (int i = 0; i < m; i++)
    {
        if (b[B[i]] != 1)
            cout << B[i] <<' ';
   }

    return 0;
}