#include <iostream>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
 
using namespace std;
using namespace __gnu_pbds;
 
typedef
tree<
  int,
  null_type,
  less<int>,
  rb_tree_tag,
  tree_order_statistics_node_update>
set_t;
 
int main()
{
  set_t s;
  s.insert(12);
  s.insert(50);
  s.insert(30);
  s.insert(20);
  cout << "1st element: " << *s.find_by_order(1) << '\n';
  cout << "Position of 30: " << s.order_of_key(30) << '\n';
  return 0;
}
 

I2luY2x1ZGUgPGlvc3RyZWFtPgojaW5jbHVkZSA8ZXh0L3BiX2RzL2Fzc29jX2NvbnRhaW5lci5ocHA+CiNpbmNsdWRlIDxleHQvcGJfZHMvdHJlZV9wb2xpY3kuaHBwPgoKdXNpbmcgbmFtZXNwYWNlIHN0ZDsKdXNpbmcgbmFtZXNwYWNlIF9fZ251X3BiZHM7Cgp0eXBlZGVmCnRyZWU8CiAgaW50LAogIG51bGxfdHlwZSwKICBsZXNzPGludD4sCiAgcmJfdHJlZV90YWcsCiAgdHJlZV9vcmRlcl9zdGF0aXN0aWNzX25vZGVfdXBkYXRlPgpzZXRfdDsKCmludCBtYWluKCkKewogIHNldF90IHM7CiAgcy5pbnNlcnQoMTIpOwogIHMuaW5zZXJ0KDUwKTsKICBzLmluc2VydCgzMCk7CiAgcy5pbnNlcnQoMjApOwogIGNvdXQgPDwgIjFzdCBlbGVtZW50OiAiIDw8ICpzLmZpbmRfYnlfb3JkZXIoMSkgPDwgJ1xuJzsKICBjb3V0IDw8ICJQb3NpdGlvbiBvZiAzMDogIiA8PCBzLm9yZGVyX29mX2tleSgzMCkgPDwgJ1xuJzsKICByZXR1cm4gMDsKfQo=