Merge pull request encrypted-def#269 from hehehwang/0x16-21939

encrypted-def · web-flow · commit f12bfec7bf71 · 2022-03-30T08:56:14.000+09:00
(0x16 이진 검색 트리) Update 21939.cpp
diff --git a/0x16/solutions/21939.cpp b/0x16/solutions/21939.cpp
@@ -1,11 +1,48 @@
-// Authored by : BaaaaaaaaaaarkingDog
+// Authored by : heheHwang
 // Co-authored by : -
-// http://boj.kr/****************
+// http://boj.kr/b08e041f30cd4b509604d115173e4fd9
 #include <bits/stdc++.h>
 using namespace std;
 
-int main(void){
+string op;
+int N, L, P, x;
+int probLevel[100'002];     // 이 문제가 어느 난이도였는지 저장
+set<int> probByLevel[102];  // 난이도별로 문제 저장
+int main(void) {
   ios::sync_with_stdio(0);
   cin.tie(0);
-   
+
+  cin >> N;
+  while (N--) {
+    cin >> P >> L;
+    probLevel[P] = L;
+    probByLevel[L].insert(P);
+  }
+  cin >> N;
+  while (N--) {
+    cin >> op;
+    if (op == "recommend") {
+      cin >> x;
+      if (x == 1) {
+        for (int i = 100; 0 <= i; i--) {
+          if (probByLevel[i].empty()) continue;
+          cout << *(prev(probByLevel[i].end())) << '\n';
+          break;
+        }
+      } else {
+        for (int i = 0; i < 101; i++) {
+          if (probByLevel[i].empty()) continue;
+          cout << *probByLevel[i].begin() << '\n';
+          break;
+        }
+      }
+    } else if (op == "add") {
+      cin >> P >> L;
+      probLevel[P] = L;
+      probByLevel[L].insert(P);
+    } else if (op == "solved") {
+      cin >> P;
+      probByLevel[probLevel[P]].erase(P);
+    }
+  }
 }
