multiset的插入與刪除

<span style="font-size:14px;">#include <iostream>
#include<functional>
#include <set>
#include<iterator>
#include <algorithm>
using namespace std;

int main ()
{
	typedef multiset<int,greater<int> > IntSet;
	IntSet myset;
  
  	int myints[] = {75,23,65,42,23};
  
  	for( int i = 0; i < 5; i++ )
 	{
  		myset.insert( myints[i] );
 	}
  
  	for( IntSet::const_iterator cite = myset.begin(); cite != myset.end(); ++cite )
 	{
  		cout << *cite << ' ';  // 75 65 42 23 23  
 	}
  
    multiset< int, greater<int> >::iterator ite = find( myset.begin(), myset.end(), 23 );
  
    if( ite != myset.end() )
    {
    	myset.erase(ite);  //只刪除一個，而 myset.erase(23); 會刪除所有值爲23的元素  
    }
    
	cout << endl;
	for( IntSet::const_iterator cite = myset.begin(); cite != myset.end(); ++cite )
 	{
  		cout << *cite << ' ';  // 75 65 42 23 
 	}
  
  
  	std::cout << '\n';

    return 0;
}



</span>