Very easy solution | Array based intuition
Intuition
Mice 1 has limitation that it cannot eat more than k cheese.
So, Mice 1 will always choose top K highest rewarded cheese.
Highest rewarded cheese is t
# Intuition
1. Mice 1 has limitation that it cannot eat more than k cheese.
2. So, Mice 1 will always choose top K highest rewarded cheese.
3. Highest rewarded cheese is the one where difference between reward1 and reward2 is highest. 

# Code
```csharp []
public class Solution {
    public int MiceAndCheese(int[] reward1, int[] reward2, int k) {
        int n = reward1.Length;
        var diff = new int[n];
        var result = 0;
        for (int i=0; i<n; i++)
        {
            diff[i] = reward1[i] - reward2[i];
            result += reward2[i];
        }

        Array.Sort(diff);

        for(int i=0; i<k; i++)
        {
            result += diff[n-1-i];
        }

        return result;
    }
}
```
['C#']