Predict output when iterating ordered keys

Problem Statement

Given a SortedMap (a data structure that maintains keys in ascending order) and an integer target, design a function that performs the following logic:

1. Iterate through the keys in descending order.
2. Maintain a running sum of the values associated with the keys visited.
3. If the current key is even, multiply the current running sum by 2.
4. If the running sum exceeds the target, stop iterating immediately and return the current sum.
5. If the map is fully traversed, return the final running sum.

Function Signature

def process_map_sum(data: dict, target: int) -> int:
    # data is a dictionary representing the sorted map
    # keys are integers, values are integers
    pass

Constraints

• The input map will contain between 1 and 1000 keys.
• Keys and values are between -10^4 and 10^4.
• target is between -10^6 and 10^6.

Example 1

Input: data = {1: 10, 2: 20, 3: 30}, target = 50 Order (Descending): 3, 2, 1

1. Key 3: sum = 30.
2. Key 2 (even): sum = (30 + 20) * 2 = 100.
3. 100 > 50, return 100.

Output: 100

Example 2

Input: data = {1: 5, 2: 5}, target = 100 Order (Descending): 2, 1

1. Key 2 (even): sum = 5 * 2 = 10.
2. Key 1: sum = 10 + 5 = 15. Output: 15