We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
  1. Prepare
  2. C++
  3. STL
  4. Sets-STL
  5. Discussions

Sets-STL

  • 2200290130080ITB
     + 1 comment
    #include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <set>
#include <algorithm>
using namespace std;

int main() {
    /* Enter your code here. Read input from STDIN. Print output to STDOUT */
    set<int> s;
    int Q;
    cin>>Q;
    for(int i=0; i<Q; i++){
        int query;
        int x;
        cin>>query;
        cin>>x;
        switch (query) {
        case 1:
            s.insert(x);
            break;
        case 2:
            s.erase(x);
            break;
        case 3:
            auto itr=s.find(x);
              
            if(itr !=s.end()) {
                cout<<"Yes"<<endl;
            } 
            else{
                 cout<<"No"<<endl;
            }
            break;
        }
    }
    return 0;
}