Editorial for Mock CCC '18 Contest 3 J4/S2 - A Median Problem - Olympiads Online Judge

Editorial for Mock CCC '18 Contest 3 J4/S2 - A Median Problem

Remember to use this editorial only when stuck, and not to copy-paste code from it. Please be respectful to the problem author and editorialist.
Submitting an official solution before solving the problem yourself is a bannable offence.

Author: xiaowuc1

We can sort each of the sequences in $\mathcal O(N \log N)$ $O (N \log N)$ time and grab the median, as it will be the element at index $\frac{N}{2}$ $\frac{N}{2}$ .

We can then accumulate all of these entries and use the same routine as earlier to grab the desired median.

Comments

There are no comments at the moment.