using sorting beats(100%)
Intuition\n Describe your first thoughts on how to solve this problem. \n\n# Approach\n Describe your approach to solving the problem. \n\n# Complexity\n- Time 
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\n\n# Approach\n<!-- Describe your approach to solving the problem. -->\n\n# Complexity\n- Time complexity:\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity:\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```\n\nclass Solution(object):\n    def miceAndCheese(self, reward1, reward2, k):\n        """\n        :type reward1: List[int]\n        :type reward2: List[int]\n        :type k: int\n        :rtype: int\n        """\n        new_arr=[(reward1[i]-reward2[i],reward1[i] , reward2[i]) for i in range(len(reward2))]\n        new_arr.sort(reverse=True)\n        res = 0\n        for i in range(k):\n            res += new_arr[i][1]\n            \n        for i in range(k , len(reward1)):\n            res += new_arr[i][2]\n        return res\n\n        \n```
['Python']