set

#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <math.h>
#include <set>
#include <iostream>
#include <algorithm>

using namespace std;

int main( )
{
    set<int>s1,s2,c,d,e;
    int i, j;
    for (i = 0; i < 10; i++)
        s1.insert(i);
    for (i = 5; i < 15; i++)
        s2.insert(i);
    for (set<int>::iterator p = s1.begin( ); p != s1.end( );++p)
        cout<<*p<<" ";
    puts("\n并集：\n");
     set_union(s1.begin( ), s1.end( ),s2.begin( ),s2.end( ),insert_iterator<set<int> >(c,c.begin( )));
    for ( set<int>::iterator q = c.begin( ); q != c.end( ); ++q)
        cout<<*q<<" ";

    puts("\n交集：\n");
     set_intersection(s1.begin( ), s1.end( ),s2.begin( ),s2.end( ),insert_iterator<set<int> >(d,d.begin( )));
    for ( set<int>::iterator l = d.begin( ); l != d.end( ); ++l)
        cout<<*l<<" ";
    puts("\n差集：\n");

     set_difference(s1.begin( ), s1.end( ),s2.begin( ),s2.end( ),insert_iterator<set<int> >(e,e.begin( )));
    for ( set<int>::iterator k = e.begin( ); k != e.end( ); ++k)
        cout<<*k<<"  ";
      return 0;
}