Python Solution
\n\n# Code\n\nclass Solution:\n    def miceAndCheese(self, reward1: List[int], reward2: List[int], k: int) -> int:\n        res = sum(reward2)\n\n        li = [
\n\n# Code\n```\nclass Solution:\n    def miceAndCheese(self, reward1: List[int], reward2: List[int], k: int) -> int:\n        res = sum(reward2)\n\n        li = []\n\n        for i in range(len(reward1)):\n            diff = reward1[i] - reward2[i]\n            li.append(-diff)\n        \n        heapq.heapify(li)\n        \n        while k > 0 and len(li) > 0:\n            diff = heapq.heappop(li)\n            res += -diff\n            k -= 1\n        \n        return res\n```
['Heap (Priority Queue)', 'Python3']