题解 | 数组计数维护

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

int solve() {
    int n = 0, k = 0, S = 0, cnt = 0;
    vector<int>arr(n + 1, 0);
    cin >> n >> k ;
    for (int i = 0; i < n; i++) {
        cin >> arr[i];
        if (arr[i] >= k) S += arr[i];
        else if (arr[i] == 0 && S >= 1) {
            S -= 1;
            cnt += 1 ;
        }
    }
    cout << cnt << endl;
    return cnt;
}

int main() {
    int T = 0;
    cin >> T ;
    while (T--) 
    {
        solve();
    }
}
// 64 位输出请用 printf("%lld")