#include<iostream>
#include<set>
#include<iterator>
using namespace std;
 
int main()
{
       set<int> t;
 
       t.insert( 50 );
       t.insert( 60 );
       t.insert( 10 );
       t.insert( 20 );
       t.insert( 50 );        //  this will not insert at set, 
                            //    Because it is already in set
       t.insert( 30 );
 
 
       set<int>::iterator i;        // You will see all data in Sort 
       for( i = t.begin (); i!= t.end(); ++i)
       {
           cout << (*i) << " : " <<  endl;
       }
 
        printf(" Size is %d\n",t.size() );
        t.clear();                                // clear all
 
       printf("\n\t\t*** Thanks ...\n");
       getchar();
       return 0;
}