sonho00 / algorithm-template Goto Github PK

#include<bits/extc++.h>
using namespace __gnu_pbds;
template<typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
// order_of_key(k) : The number of items in a set that are strictly smaller than k
// find_by_order(k) : It returns an iterator to the k-th largest element