Subarray with given sum by prefixsum

#include <iostream>

using namespace std;

int binarySearch(int arr[], int l, int r, int x)
{
    if (r >= l) {
        int mid = l + (r - l) / 2;

        if (arr[mid] == x)
            return mid;

        if (arr[mid] > x)
            return binarySearch(arr, l, mid - 1, x);
            
        return binarySearch(arr, mid + 1, r, x);
    }
    return -1;
}

int subArraySum(int a[],int n,int s)
{
    int prefixsum[n];

    prefixsum[1]=a[1];
    for(int i=2;i<=n;i++)
    {
        prefixsum[i]=prefixsum[i-1]+a[i];
    }

    for(int i=1;i<=n;i++)
    {
        cout<<  prefixsum[i]<<" ";

    }
cout<<endl;

    int j=1,d;
    for(int i=1;i<=n;i++){

        if(prefixsum[i]==s)
        {
            cout<<j<<" "<<i<<endl;
            return 1;
        }
        else
        {
            if(prefixsum[i]>s)
            {
               d=prefixsum[i]-s;
               cout<<d<<endl;
              j=binarySearch(prefixsum,j,i,d);

               cout<<j<<endl;
               if(j== -1)
               {
                   continue;
               }

               cout<<j+1<<" "<<i<<endl;
               return 1;
            }
        }
}
        cout<<-1<<endl;
return 0;
}

 int main() {
	//code

    int t;
    cin>>t;
    while(t--)
    {
        int n,s;
        cin>>n>>s;
        int a[n];
        for(int i=1;i<=n;i++)
        {
            cin>>a[i];
        }

        subArraySum(a,n,s);

    }

	return 0;
}