题解 | 数组计数维护

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

int main() {
   int T;
   cin >> T;
   while(T--){
    int n,k;
    cin >> n >> k;
    long long S = 0;
    int cnt = 0;
    vector<int>a(n);
    for(int i = 0;i<n;i++){
        cin >> a[i];
        if(a[i]>=k){
            S+=a[i];
        }else if(a[i]==0 &&S>=1){
            cnt++;
            S--;
        }
    }
    cout << cnt <<endl;
   }
}