(This question is a variation of the LeetCode question 23. Merge k Sorted Lists . If you haven't completed that question yet, it is recommended to solve it first.)
You are given k sorted lists of price change events for a financial instrument, called streams. Each list is sorted chronologically by timestamp. Each event in these lists is a string "<timestamp>, <price_change>" (e.g., "1, 7"), where timestamp indicates when the change occurs and price_change represents the change amount (which can be positive or negative).
The current_price at any given timestamp is defined as the sum of all price_change values from the first timestamp up to and including that timestamp, assuming the initial price of the instrument is 0. If multiple price change events occur at the exact same timestamp, their changes should be aggregated and applied together.
