RMID2  Running Median Again
Danish has just solved the problem Running Median.
The first line of the problem says "You will be given some integers in nondecreasing order". The problem asks you to report and remove the median of the list every time it is queried.
Having solved this problem, Danish now begins to wonder how to solve the problem if the input is in any order (not necessarily nondecreasing order as mentioned above).
Can you help him?
Your task is to take as input a list of positive integers. Whenever 1 is given as input, you must output the median of the list, and remove it from the list. Take the smaller element as the median in case of even number of elements.
Input
The input contains several test caes.
The first line contains an integer t, the number of test cases.
Each test case has several lines, each containing an integer n (<=10^9) . If n is positive, add it to the list. n=1 indicates a median query (there will be no median query if the list is empty). The test case is terminated by n=0.
In each test case, there will be upto 10^5 integers to be added to the list, and upto 10^5 median queries.
Output
For each median query as described above, print the median on a new line.
Example
Input: 1 9 10 2 5 1 18 1 1 4 3 1 8 7 1 0 Output: 5 9 3 7
hide comments
parijat bhatt:
20150625 11:31:17
coordinate compression+BIT 

Gannu_raj:
20150604 15:15:02
Why it gives me WA ? I using maxheap and minheap .


Abhilash:
20150311 15:06:02
Used fast I/O 

Praveen Yadav:
20150303 08:14:48
In this example test case


Bharath Reddy:
20140927 07:03:23
Used the same solution I wrote for RMID (except for the I/O reading) and got AC here. 

joud zouzou:
20140116 12:00:51
Why is the second query's answer is 9?


Surendra:
20131108 09:53:39
@Akhilesh : Can there be duplicate elements as well ?

Added by:  Akhilesh Anandh 
Date:  20131005 
Time limit:  0.100s1s 
Source limit:  50000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All except: ASM64 
Resource:  variation on RMID 