C++ set 交集 并集 差集

参考博客： https://blog.csdn.net/zzh1301051836/article/details/48808141

#include <iostream>
#include <set>
#include <algorithm>

using namespace std;
void put_in(set<int> &p)
{
    int q;
    cin>>q;
    while(q --)
    {
        int value;
        cin>>value;
        p.insert(value);
    }
}

void put_out(set<int> &p)
{
    set<int>::iterator it = p.begin();
    while(it != p.end())
    {
        cout<<*it<<" ";
        it ++;
    }
}

int main()
{
    int T,T1=1;
    cin>>T,T1;
    while(T1 <= T)
    {
        set<int> A,B,RUnion,RIntersec,RDiff1,RDiff2;
        put_in(A);
        put_in(B);
        //交
        set_intersection(A.begin(),A.end(),B.begin(),B.end(),inserter(RIntersec,RIntersec.begin()));
        //并