Hey; anyone in competitive programming here? I have 1 question,

Question

Hey; anyone in competitive programming here? I have 1 question,

and can not find a solution.
We have an unordered array of uniqe integers.
We need to split this array into 2 equal piles, and all items in first pile should be lesser than all in second (not sum, every single one).
Hard part here is to do this with just one loop trough array.
So it not just O(n), but just to go trough every element once.
So you can not find "median" and then split it
it should be somehow in real-time or so
I was think about take parts from quick sort or so, but they're not reliable enough
Any ideas?

#english #programming

0

27.05.2019