题解 | 魔导模块的效能迭代

#include <iostream>
#include <vector>
using namespace std;

class Solution{
public:
    int minTime(int n, int m, vector<int> a, vector<int> b) {
        for (int i = 0; i < m; i++) {
            int max = 0, max_pos, c;
            for (int j = 0; j < n; j++) {
                if (a[j] / 2 >= b[j]) c = a[j] / 2;
                else c = a[j] - b[j];
                if (c > max) {
                    max = c;
                    max_pos = j;
                } 
            }
            a[max_pos] -= max;
        }
        int ans = 0;
        for (int i = 0; i < n; i++) {
            ans += a[i];
        }
        return ans;
    }
};

int main() {
    int n, m;
    cin >> n >> m;
    vector<int> a(n), b(n);
    for (int i = 0; i < n; i++)
        cin >> a[i];
    for (int i = 0; i < n; i++) 
        cin >> b[i];
    Solution sol;
    cout << sol.minTime(n, m, a, b);
}
// 64 位输出请用 printf("%lld")