running

[SOLVED] Cse222 – problem: you are given three sorted arrays a, b, and c each having n numbers. you can assume that you can compare two elements from a∪b∪c in o(1)-time. let k be an integer. design an algorithm that outputs the k-th smallest element of a∪b∪c. the running time of your algorithm must be faster than o(n). try to optimize the running time of your algorithm as much as possible.