Minimise the max difference b/w heights(ND)

#include <iostream>
using namespace std;

int main() {
    
    int K;
    int N;
    cin>>K;
    cin>>N;
    int A[N];
    for(int i=0; i<N;i++){
        cin>>A[i];
    }
    
    int min = A[0];
    int max = A[0];
    
    for(int j=0 ; j<N ; j++){
        if(A[j]<min)
            min =A[j];
            
        if(A[j]>max)
            max = A[j];
    }
    
    int minH = min + K;
    int maxH = max - K;
    
    if(maxH - minH < 0){
        cout<< -(maxH - minH);
    }
    else
        cout<< maxH - minH ;

    
    
}