K-Way Merge Pattern: Merge K Sorted Sequences with a Min-Heap

TLDR: K-Way Merge uses a min-heap with exactly one entry per sorted input list. Each entry stores the current element's value plus the coordinates to find the next element in that list. Pop the minimu