题解 | 数组计数维护

#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
using namespace std;
int N = 1001;
int T = 10e5;
void solve() {
    int n, k;
    cin >> n >> k;
    int sum = 0;
    int cnt = 0;
    int a[N];
    for (int i = 0 ; i < n ; i++) {
        cin >> a[i];
        if (a[i] >= k)
            sum += a[i];
        else if (a[i] == 0 && sum >= 1) {
            sum --;
            cnt ++;
        }


    }
    cout << cnt << '\n';

}
int main() {
    int t;
    cin >> t;
    while (t--) {
        solve();
    }


    return 0;
}