<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>
multiset的插入与删除
最新推荐文章于 2024-08-02 07:40:29 发布