How to find the $k$th smallest item among the union of $C$ disjoint, sorted arrays?

There is an explanation here http://ift.tt/1Hn1TNN but I find it very unclear.

Is there a more rigorously-outlined and easily-understood algorithm for how to find the $k$th smallest item among $C$ disjoint, sorted arrays?