RMID - Running Median
You will be given some integers in non decreasing order and each time the median is queried you have to report and remove it. Take the smaller element as median in case of even elements.
The input contains many test cases. Read until End Of File.
Each test case contains n (n ≤ 100000) positive integers in non-decreasing order, along with m queries indicated by -1, all on separate lines. (See the example.)
For a query, print the current median on a single line and remove it from the list.
Each test case ends with 0 on a single line, and two test cases will be separated by an empty line. All integers are guaranteed to fit in a signed 32-bit container. A query can only occur if the list is non-empty.
For each test case output m lines containing the answers to the corresponding queries. Print an empty line after each test case.
Input: 1 2 3 4 -1 -1 5 6 7 -1 0 2 3 -1 0 Output: 2 3 5 2
use fast i/o
i my opinion linked list is best data structure here due to o(1) deletion property
In C# EOF is when Console.ReadLine() returns null
How to know when it is end of file and we need to stop taking input?
I got TLE on using cout but got AC on using printf.
This question can be easily done by using vector and by using printf and scanf.
first time implemented linked list on an online judge:)
BIT+Binary Search=AC!!:)Be careful with input format!!
Could somebody define the problem constraints better? What are the constraints of m(number of queries)?? Is m less than 10^5??
What's the median when there is one element in the list ?
|Added by:||jayant mukherji|
|Cluster:||Cube (Intel G860)|
|Languages:||All except: ASM32-GCC MAWK BC C-CLANG CPP14 CPP14-CLANG COBOL COFFEE D-CLANG D-DMD DART ELIXIR FANTOM FORTH GOSU GRV JS-MONKEY KTLN NIM OBJC OBJC-CLANG OCT PICO PROLOG PYPY R RACKET RUST CHICKEN SQLITE SWIFT UNLAMBDA VB.NET|