I'd solve the Young Tableau problem similar to the merge N arrays problem, but with a twist: starting with position (0,0), at each step, I remove the min element at (i,j) and add into my heap two more items - elements with positions (i+1,j) and (i,j+1). O(K logK), if this is correct.

Isn't 7 solved with a Young Tableau too ?