Useful example about container of SET when coding with STL.

    std::set< int > bandwidth;

    //build with ascending order
    bandwidth.insert(10);
    bandwidth.insert(1);
    bandwidth.insert(90);
    bandwidth.insert(0);
   
   

    int findedNumber = 1;
    //std::set< int , std::greater<int> >::iterator FindIter = bandwidth.find( findedNumber );
    std::set< int >::iterator FindIter = bandwidth.find( findedNumber );
    int index = 0;
    if( FindIter != bandwidth.end() )
    {
        bandwidth.erase( FindIter );
    }

    std::set< int >::const_iterator it; 
    printf("%d\n",findedNumber); 
    for(it=bandwidth.begin();it!=bandwidth.end();++it)
        printf("%d\n",(*it));

    //if you want to descending order.
    for( std::set< int >::reverse_iterator IterPos = bandwidth.rbegin();
        IterPos != bandwidth.rend(); ++IterPos )
        printf("%d\n",(*IterPos));