C++ Object-Oriented Programming 041: Set ---- (Peking University Mooc)


Special blog link

Peking University C++ POJ After-Class Exercises Blog Full Solution Record


Original title

Insert picture description here
Insert picture description here


Code

#include <iostream>
#include <string>
#include <set>
using namespace std;

int main()
{
    
    
    int opernumbers,number;
    string func;
    cin>>opernumbers;
    multiset<int> mset;
    multiset<int>::iterator m;
    set<int> tset;
    set<int>::iterator t;
    while(opernumbers--)
    {
    
    
        cin>>func;
        if(func == "add")
        {
    
    
            cin>>number;
            mset.insert(number);
            tset.insert(number);
            cout<<mset.count(number)<<endl;
        }
        else if(func == "del")
        {
    
    
            cin>>number;
            cout<<mset.count(number)<<endl;
            mset.erase(mset.lower_bound(number),mset.upper_bound(number));
        }
        else
        {
    
    
            cin>>number;
            t = tset.find(number);
            if(t == tset.end()) cout<<"0 0"<<endl;
            else    cout<<"1 "<<mset.count(number)<<endl;
        }
    }
    return 0;
}

Guess you like

Origin blog.csdn.net/qq_37500516/article/details/115048564