-
Notifications
You must be signed in to change notification settings - Fork 0
/
Indexed_Set.cpp
76 lines (65 loc) · 1.41 KB
/
Indexed_Set.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define LD long double
const int N = 100010;
int inf = 1e9;
int mod = 1e9 + 7;
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
typedef tree<int, null_type, less<int>, rb_tree_tag,
tree_order_statistics_node_update>
ordered_set;
/*
order_of_key (k)
find_by_order(k)
*/
signed main()
{
// freopen("IN", "r", stdin);
// freopen("OUT", "w", stdout);
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int T;
cin >> T;
while (T--)
{
int Q;
cin >> Q;
ordered_set s;
while (Q--)
{
string op;
int x;
cin >> op >> x;
if (op == "add")
{
s.insert(x);
}
else if (op == "remove")
{
if (s.find(x) != s.end())
{
s.erase(s.find(x));
}
}
else if (op == "find")
{
if (x >= (int)s.size())
{
cout << "-1\n";
}
else
{
cout << *(s.find_by_order(x)) << "\n";
}
}
else
{
cout << s.order_of_key(x) << "\n";
}
}
}
return 0;
}