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

int maxScore(int* nums, int numsSize, int k) {
    int *freq = (int *)malloc(sizeof(int) * (numsSize + 1));
    memset(freq, 0, sizeof(int) * (numsSize + 1));
    int maxFreq = 0;

    for (int i = 0; i < numsSize; i++) {
        int left = nums[i] - k;
        int right = nums[i] + k;
        int count = 0;
        for (int j = 0; j < numsSize; j++) {
            if (nums[j] >= left && nums[j] <= right) {
                count++;
            }
        }
        freq[count]++;
        maxFreq = fmax(maxFreq, count);
    }

    int ans = 0;
    for (int i = 1; i <= maxFreq; i++) {
        ans += (i * (i - 1)) / 2 * freq[i];
    }

    free(freq);
    return ans;
}

int main() {
    int nums[] = {1, 10, 4};
    int numsSize = sizeof(nums) / sizeof(nums[0]);
    int k = 3;
    int result = maxScore(nums, numsSize, k);
    printf("最大可能分数为： %d
", result);
    return 0;
}