Give k min product pairs in two arrays

I could solve it in MNlogK. But I would like to now what are other better approaches.