//文件名:CHAPTER9-31.cpp
#include <set>
#include <iostream>
#if _MSC_VER > 1020   // if VC++ version is > 4.2
   using namespace std;  // std c++ libs implemented in std
#endif
void main( )
{
   set <int> s1;
   set <int> :: const_iterator s1_AcIter, s1_RcIter;
   s1.insert( 10 );
   s1.insert( 20 );
   s1.insert( 30 );
   s1_RcIter = s1.upper_bound( 20 );
   cout << "The first element of set s1 with a key greater "
        << "than 20 is: " << *s1_RcIter << "." << endl;
   s1_RcIter = s1.upper_bound( 30 );
   // If no match is found for the key, end( ) is returned
   if ( s1_RcIter == s1.end( ) )
      cout << "The set s1 doesn't have an element "<< "with a key greater than 30." << endl;
   else
      cout << "The element of set s1 with a key > 40 is: "<< *s1_RcIter << "." << endl;
   // The element at a specific location in the set can be found 
   // by using a dereferenced iterator addressing the location
   s1_AcIter = s1.begin( );
   s1_RcIter = s1.upper_bound( *s1_AcIter );
   cout << "The first element of s1 with a key greater than"
        << endl << "that of the initial element of s1 is: "<< *s1_RcIter << "." << endl;
}