C# 代码
public class Solution {
public int MiceAndCheese(int[] reward1, int[] reward2, int k) {
int n = reward1.Length;
int result = 0;
for (int i = 0; i < n; i++){
result += reward2[i];
reward1[i] -= reward2[i];
}
Array.Sort(reward1);
for (int i = n - k; i < n; i++){
result += reward1[i];
}
return result;
}
}