Skip to content

feat: add multiset pbds #31

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
manoflearning merged 2 commits into from
Dec 29, 2025
Merged

feat: add multiset pbds #31

Changes from all commits
Commits
Show all changes
2 commits
Select commit Hold shift + click to select a range
5d31439
feat: add multiset pbds
manoflearning Dec 29, 2025
1438919
fix
manoflearning Dec 29, 2025
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
14 changes: 11 additions & 3 deletions src/1-ds/pbds.cpp
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -2,7 +2,15 @@
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using ordered_set = tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update>;
ordered_set st;
using pbds = tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update>;
pbds st;
st.order_of_key(x); // number of elements strictly less than x
st.find_by_order(x); // value of xth element (0-based)
st.find_by_order(x); // value of xth element (0-based)

// multiset pbds (use "less_equal<int>" and custom "m_erase")
using multi_pbds = tree<int, null_type, less_equal<int>, rb_tree_tag, tree_order_statistics_node_update>;
void m_erase(multi_pbds &OS, int val) {
int index = OS.order_of_key(val);
multi_pbds::iterator it = OS.find_by_order(index);
OS.erase(it);
}