RE求调

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

#define MAX_VAL 2000000  // 足够大的范围

int main() {
    int N, C;
    scanf("%d %d", &N, &C);
    
    int* count = (int*)calloc(MAX_VAL, sizeof(int));
    int* numbers = (int*)malloc(N * sizeof(int));
    
    // 读取数字并计数
    int min_val = MAX_VAL, max_val = 0;
    for (int i = 0; i < N; i++) {
        scanf("%d", &numbers[i]);
        count[numbers[i]]++;
        if (numbers[i] < min_val) min_val = numbers[i];
        if (numbers[i] > max_val) max_val = numbers[i];
    }
    
    long long result = 0;
    
    // 统计满足 A - B = C 的数对
    for (int i = 0; i < N; i++) {
        int A = numbers[i];
        int B = A - C;
        
        if (B >= min_val && B <= max_val) {
            result += count[B];
        }
    }
    
    printf("%lld\n", result);
    
    free(count);
    free(numbers);
    return 0;
}