Day35.cpp

// Policy based Ds

// https://www.interviewbit.com/problems/policy-based-ds/

/*
#include<bits/stdc++.h>
using namespace std;

// Program showing a policy-based data structure. 
#include <ext/pb_ds/assoc_container.hpp> // Common file 
#include <ext/pb_ds/tree_policy.hpp> 
#include <functional> // for less 
#include <iostream> 
using namespace __gnu_pbds; 
using namespace std; 
  
// a new data structure defined. Please refer below 
// GNU link : https://goo.gl/WVDL6g 
typedef tree<int, null_type, less<int>, rb_tree_tag, 
             tree_order_statistics_node_update> 
    ordered_set; 
  
*/


// Driver code 
int main() 
{ 
    ordered_set X;
    X.insert(8);
    X.insert(2);
    X.insert(1);
    X.insert(16);
    X.insert(4);
    
    // value at 2nd index in sorted array
    cout << *X.find_by_order(2) << "\n";
    
    // index of number 7
    cout << X.order_of_key(7) << "\n";
    
    return 0;
    
}