2022-09-08 修正了STL_N题解

cairbin/【ACM-作业2】STL入门/STL_N_STL-Set.cpp

+/*
+ * Description:
+ * @url:https://vjudge.csgrandeur.cn/contest/513104#problem/N
+ * @author:CairBin
+ * @since:2022-09-08
+ */
+
 #include <iostream>
 #include <set>
-#include <algorithm>
 
 using namespace std;
 
 int main()
 {
-    int n;
-    while(cin >> n)
+    int t;
+    while(cin >> t)
     {
-        set<int> num;
-        int a,b;
-        for(int i=0; i<n; i++)
+        set<int> s;
+        for(int i=0; i<t;i++)
         {
-            cin >> a >> b;
-            if(a == 3)
+            int query,n;
+            cin >> query;
+            if(query == 1)
             {
-                auto iter = find(num.begin(), num.end(), b);
-                if(iter == num.end())
-                    cout << "No" << endl;
-                else
+                cin >> n;
+                s.insert(n);
+            }
+            else if(query == 2)
+            {
+                cin >> n;
+                if(s.find(n)!=s.end())
+                    s.erase(s.find(n));
+            }
+            else{
+                cin >> n;
+                if(s.find(n)!=s.end())
                     cout << "Yes" << endl;
+                else
+                    cout << "No" << endl;
             }
-            else if(a == 2)
-                num.erase(find(num.begin(), num.end(), b));
-            else
-                num.insert(b);
         }
     }
+
     return 0;
 }
\ No newline at end of file