#include <iostream>
#include <cstdlib>
#include <set>
#include <algorithm>
#include <iterator>
using namespace std ;

int main(int argc, char * argv[])
{
	set<char> set1 ;
	set<char> set2 ;

	set1.insert('j') ;
	set1.insert('u') ;
	set1.insert('s') ;
	set1.insert('t') ;
	set1.insert('i') ;
	set1.insert('n') ;

	set2.insert('m') ;
	set2.insert('i') ;
	set2.insert('l') ;
	set2.insert('l') ;
	set2.insert('e') ;
	set2.insert('r') ;

	// algorithm
	cout << "Union of 'justin' and 'miller' = " ;
	set_union(set1.begin(), set1.end(), 
		set2.begin(), set2.end(), ostream_iterator<char>(cout, " ") ) ;

	cout << endl ;

	cout << "Intersection of 'justin' and 'miller' = " ;
	set_intersection(set1.begin(), set1.end(), 
		set2.begin(), set2.end(), ostream_iterator<char>(cout, " ") ) ;

	cout << endl ;

	cout << "Difference of 'justin' and 'miller' = " ;
	set_difference(set1.begin(), set1.end(), 
		set2.begin(), set2.end(), ostream_iterator<char>(cout, " ") ) ;

	cout << endl ;

	return EXIT_SUCCESS ;
}