Program to find Smallest Subarray with sum greater than a given value in C

#include <stdio.h>

int min(int a, int b){
    if(a>b)
        return b;
    
    return a;
}

int main(){
    int arr[] = {1, 4, 45, 6, 0, 19};
    int n = sizeof(arr)/sizeof(arr[0]);
    int value = 51;
    int length = n;
    
    for(int i=0; i<n; i++){
        int curr_sum = 0;
        for(int j=i; j<n; j++){ curr_sum += arr[j]; if(curr_sum > value){
                length = min(length, (j-i+1));
                break;
            }
        }
    }
    
    printf("%d", length);
    
}