c#, sorting
Intuition\n Describe your first thoughts on how to solve this problem. \nWe should order by reward2[i] - reward1[i] and let 1st mouse eat top k items\n\n# Appro
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\nWe should order by `reward2[i] - reward1[i]` and let 1st mouse eat top `k` items\n\n# Approach\n<!-- Describe your approach to solving the problem. -->\nLinq query\n\n# Complexity\n- Time complexity:\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n$$O(n)$$\n\n- Space complexity:\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n$$O(n)$$, due to Linq\n\n# Code\n```\npublic class Solution {\n    public int MiceAndCheese(int[] reward1, int[] reward2, int k) => reward1\n        .Zip(reward2, (r1, r2) => (r1, r2))\n        .OrderBy(item => item.r2 - item.r1)\n        .Select((item, index) => index <= k - 1 ? item.r1 : item.r2)\n        .Sum();\n}\n```
['C#']