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 (1-based) from a specified data after the list was sorted ascendingly
- Print data from a specified index (1-based) after the list was sorted ascendingly
Input
Input contains several lines. Each line follows one of these formats.
1 n: Insert n (0 <= n <= 231 - 1) to the list
2 n: Remove n from the list. If n was not found, do nothing
3 n: Print n's index (1-based) after the list was sorted ascendingly
4 i: Print data on i-th index (1-based) after the list was sorted ascendingly (0 <= i <= 231 - 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 i-th index in one line. If the index is not valid, just print -1
Example
Input: 3 20
-1 Output: -1
hide comments
Min_25:
2017-04-24 10:20:07
The maximum number of queries is around 3000000.
|
|
pvsmpraveen:
2017-04-23 14:05:02
There should be an upper limit mentioned on how many values at max will be in present in the list ,
|
|
pvsmpraveen:
2017-04-23 05:51:30
4 i: Print data on ith index (0 <= i <= 2^31 - 1)
|
|
Vipul Srivastava:
2017-04-22 18:55:02
how many lines can be there? And will there be unique numbers always in the list?
|
Added by: | Lucas |
Date: | 2017-04-22 |
Time limit: | 1s-1.350s |
Source limit: | 50000B |
Memory limit: | 1536MB |
Cluster: | Cube (Intel G860) |
Languages: | All |