say that it's a min queue now

Author: lrvideckis

library/data_structures_[l,r)/uncommon/priority_queue_of_updates.hpp

@@ -26,7 +26,7 @@ template<class F, class G> struct pq_updates {
     upd(upd_params);
     st.emplace_back(mp.emplace(pri, sz(st)), upd_params);
   }
-  void pop() {
+  void pop_min() {
     int l = sz(st), r = l;
     for (auto& [_, i] : mp) {
       l = min(l, i);

tests/library_checker_aizu_tests/data_structures/pq_ds_undo_sliding_window.test.cpp

@@ -28,7 +28,7 @@ int main() {
   cout << stm.get_max();
   rep(i, l, n) {
     pq.push(pri++, {arr[i], arr[i]});
-    pq.pop();
+    pq.pop_min();
     cout << " " << stm.get_max();
   }
   cout << '\n';

tests/library_checker_aizu_tests/handmade_tests/pq_updates.test.cpp

@@ -31,7 +31,7 @@ int main() {
           solver.push(pri, {upd_id, upd_id});
           naive_mp[{pri, upd_id}] = upd_id;
         } else {
-          solver.pop();
+          solver.pop_min();
           auto max_it = begin(naive_mp);
           naive_mp.erase(max_it);
         }