ALLIN1  All in One
Before you begin, you should try this problem! AVL Tree
This problem is simple. Initially, there is a list and it's empty. Then you are given four types of query.
 Insert data to the list
 Remove data from the list
 Print an index (1based) from a specified data after the list was sorted ascendingly
 Print data from a specified index (1based) after the list was sorted ascendingly
Input
Input contains several lines. Each line follows one of these formats.
1 n: Insert n (0 <= n <= 2^{31}  1) to the list
2 n: Remove n from the list. If n was not found, do nothing
3 n: Print n's index (1based) after the list was sorted ascendingly
4 i: Print data on ith index (1based) after the list was sorted ascendingly (0 <= i <= 2^{31}  1)
1: End of input
Output
For each query 3, print n's index in one line. If n was not found, just print 1
For each query 4, print data on ith index in one line. If the index is not valid, just print 1
Example
Input: 3 20
1 Output: 1
hide comments
hrishabh:
20170509 12:59:44
Can anyone help i am getting time limit exceed, all operations answered in O(1) but still :( .


pandey01:
20170425 13:50:37
Anyone pro here? i need some help...


pvsmpraveen:
20170424 17:01:05
Thank you MIN_25, that helped me!


Min_25:
20170424 10:20:07
The maximum number of queries is around 3000000.


pvsmpraveen:
20170423 14:05:02
There should be an upper limit mentioned on how many values at max will be in present in the list ,


pvsmpraveen:
20170423 05:51:30
4 i: Print data on ith index (0 <= i <= 2^31  1)


Vipul Srivastava:
20170422 18:55:02
how many lines can be there? And will there be unique numbers always in the list?

Added by:  Lucas 
Date:  20170422 
Time limit:  0.75s1.350s 
Source limit:  50000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All 