HackerRank C++ Sets-STL Problem

SetsSTLHackerRank.cpp

#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <set>
#include <algorithm>
using namespace std;


int main() {
    set<int> s;
    int q;
    cin>>q;
    while(q){
        int operationType, x;
        cin>>operationType>>x;
        switch(operationType){
            case 1: s.insert(x);
                break;
            case 2: s.erase(x);
                break;
            case 3:
                set<int>::iterator itr = s.find(x);
                if(itr==s.end()){
                    cout<<"No"<<endl;
                }else{
                    cout<<"Yes"<<endl;
                }
        }
        q--;
    }
    return 0;
}