Leetcode 2570. Merge Two 2D Arrays by Summing Values

Merge two sorted lists of [id, value] pairs with unique ids into a single list sorted by id, summing values for ids that appear in both (treat missing ids as 0). The core challenge is merging two sorted arrays and combining entries with matching keys.