题解 | 数组计数维护

#include <stdio.h>

int main() {
    int j = 0;
    int T = 0;
    int t = 0;
    int arr1[10000];
    scanf("%d", &T);
    t = T;
    while (T) {

        int n, k;
        int S, cnt;
        S = cnt = 0;
        scanf("%d", &n);
        scanf("%d", &k);
        int arr[10000];
        for (int i = 0; i < n; i++) {
            scanf("%d", &arr[i]);
        }
        for (int i = 0; i < n; i++) {
            if (arr[i] >= k) {
                S = S + arr[i];
            } else if (arr[i] == 0 && S >= 1) {
                S = S - 1;
                cnt = cnt + 1;
            }
        }

        arr1[j] = cnt;
        j++;
        T--;
    }
    for (int i = 0; i < t; i++) {
        printf("%d\n", arr1[i]);
    }

    return 0;
}