ORDERSET  Order statistic set
English  Vietnamese 
In this problem, you have to maintain a dynamic set of numbers which support the two fundamental operations
 INSERT(S,x): if x is not in S, insert x into S
 DELETE(S,x): if x is in S, delete x from S
and the two type of queries
 KTH(S) : return the kth smallest element of S
 COUNT(S,x): return the number of elements of S smaller than x
Input
 Line 1: Q (1 ≤ Q ≤ 200000), the number of operations
 In the next Q lines, the first token of each line is a character I, D, K or C meaning that the corresponding operation is INSERT, DELETE, KTH or COUNT, respectively, following by a whitespace and an integer which is the parameter for that operation.
If the parameter is a value x, it is guaranteed that 0 ≤ x ≤ 10^{9}. If the parameter is an index k, it is guaranteed that 1 ≤ k ≤ 10^{9}.
Output
For each query, print the corresponding result in a single line. In particular, for the queries KTH, if k is larger than the number of elements in S, print the word 'invalid'.
Example
Input 8 I 1 I 1 I 2 C 0 K 2 D 1 K 1 K 2 Output 1 2 2 invalid
hide comments
ariel:
20151216 21:02:39
coordinate compresion + segment tree + unordered_map = accepted!


Anubhav Gupta:
20151101 09:45:32
BIT is awesome!! 

Obliterator:
20151031 15:31:51
crazy time limit 

Abhinandan Agarwal:
20151019 14:56:29
Accepted in 0.21s :) 

Sonu Sharma:
20150913 10:52:02
Century(100th) on spoj with a best problem..:D 

satya_jha123:
20150906 22:21:53
COULD NOT WRITE MY OWN CODE BUT LEARNT A LOT 

anando_du:
20150723 21:45:44
^_^ finally got AC ^_^ rank #3 ^_^ 

xxbloodysantaxx:
20150721 23:31:16
For K type of queries O (Log N ^ 2 ) else wise O (Log N) and I used encoding . BIT <3 is simply fast and unstoppable 

Ayush Mishra:
20150719 04:56:51
Finally accepted using treap! 

i_am_looser:
20150528 13:09:25
Finally AC..... ;)

Added by:  Duc 
Date:  20081028 
Time limit:  0.300s 
Source limit:  50000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All except: ERL JSRHINO NODEJS PERL6 VB.NET 
Resource:  © VNOI 