SET与MULTISET

正常情况下

#include<bits/stdc++.h>
using namespace std;
int main()
{
    set<int>S;//不可重复
    multiset<int>K;//可重复
    int n;
    if(!S.empty())S.clear();//判空，清空
    if(!K.empty())K.clear();

    for(int i = 0; i<10; i++)
    {
        cin>>n;
        S.insert(n);//insert
        K.insert(n);
    }
    set<int>::iterator it;
    multiset<int>::iterator mt;
    for(it = S.begin();it!=S.end();it++)cout<<*it<<" ";
    cout<<endl<<S.size()<<endl;//当前集合大小
    for(it = S.begin(); it != S.end(); it++)
    {
        if(*it==5)S.erase(*it);//删除
    }
    for(it = S.begin();it!=S.end();it++)cout<<*it<<" ";
    cout<<endl<<K.size()<<endl;
    for(mt = K.begin(); mt!=K.end();mt++)cout<<*mt<<" ";
    return 0;
}

重载

#include<bits/stdc++.h>
using namespace std;
struct man//重载排序：由大到小
{
    int num;
    bool operator<(const man x)const
    {
        return num>x.num;
    }
};
int main()
{
    set<man>S;//不可重复
    multiset<man>K;//可重复
    int n;
    if(!S.empty())S.clear();//判空，清空
    if(!K.empty())K.clear();

    for(int i = 0; i<10; i++)
    {
        cin>>n;
        S.insert((man){n});//重载时的insert
        K.insert((man){n});
    }

    set<man>::iterator it;
    multiset<man>::iterator mt;

    for(it = S.begin();it!=S.end();it++)cout<<(*it).num<<" ";
    cout<<endl<<S.size()<<endl;//当前集合大小

    for(it = S.begin(); it != S.end(); it++)
    {
        if((*it).num==5)S.erase(*it);//删除
    }
    for(it = S.begin();it!=S.end();it++)cout<<(*it).num<<" ";
    cout<<endl<<K.size()<<endl;

    for(mt = K.begin(); mt!=K.end();mt++)cout<<(*mt).num<<" ";
    return 0;