Submission #73497264

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
#define int long long


void sol();


struct Eggs {
    int sum, days;
};

signed main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int t;cin >> t;
    while(t--)  sol();
    return 0;
}

void sol() {
    queue<Eggs> q;//有多少蛋 和他们第几天会过期
    int n, d;
    cin >> n >> d;

    for (int i = 0; i < n; ++i) {
        int a;
        cin >> a;
        q.push({a, i + d});
    }

    for (int i = 0; i < n; ++i) {
        int b;
        cin >> b;
        while(b > 0 && !q.empty()) {
            if(q.front().sum > b) {
                q.front().sum -= b;
                b = 0;
            } else {
                b -= q.front().sum;
                q.pop();
            }
        }
        while(!q.empty() && q.front().days <= i) {
            q.pop();
        }
    }

    int ans = 0;
    while(!q.empty()){
        ans += q.front().sum;q.pop();
    }
    cout << ans << '\n';
}

Submission Info

Judge Result