Laddar uppgiften…
Imagine two invoices where each row contains an item value and its weight. Write a function merge_items that receives two lists of pairs, where each pair contains a value and a weight, and values do not repeat within the same list. Merge the lists by adding weights for matching values and keeping unique values as they are. Return the pairs sorted by value.
[[1, 1], [4, 5], [3, 8]], [[3, 1], [1, 5]][[1, 6], [3, 9], [4, 5]][[1, 1], [3, 2], [2, 3]], [[2, 1], [3, 2], [1, 3]][[1, 4], [2, 4], [3, 4]][[1, 3], [2, 2]], [[7, 1], [2, 2], [1, 4]][[1, 7], [2, 4], [7, 1]]def merge_items(items1: list[list[int]], items2: list[list[int]]) -> list[list[int]]:
Logga in för att se historik över inskick
Logga inLogga in för att använda AI-mentorn
Logga inThey run when you press "Submit" — your whole solution is checked against them so you can't hard-code answers for the visible cases.