Number of Sub-arrays of Size K and Average Greater than or Equal to Threshold - Problem

#include <stdio.h>
#include <stdlib.h>
#include <string.h>

int solution(int* arr, int n, int k, int threshold) {
    int count = 0;
    
    // Check each possible sub-array of size k
    for (int i = 0; i <= n - k; i++) {
        // Calculate sum of current sub-array
        int currentSum = 0;
        for (int j = i; j < i + k; j++) {
            currentSum += arr[j];
        }
        
        // Check if average >= threshold
        // To avoid floating point, compare sum >= threshold * k
        if (currentSum >= threshold * k) {
            count++;
        }
    }
    
    return count;
}

int main() {
    char line[10000];
    fgets(line, sizeof(line), stdin);
    
    // Parse array
    int arr[1000];
    int n = 0;
    char* token = strtok(line, "[,]");
    while (token != NULL) {
        if (strlen(token) > 0 && token[0] != '\n' && token[0] != ']') {
            arr[n++] = atoi(token);
        }
        token = strtok(NULL, "[,]");
    }
    
    int k, threshold;
    scanf("%d", &k);
    scanf("%d", &threshold);
    
    int result = solution(arr, n, k, threshold);
    printf("%d\n", result);
    return 0;
}