q7

int smallestSubWithSum(int a[], int n, int x)
    {
          int ans=n,sum=0;
       int i=0,j=0;
       while(j<n)
       {
           sum+=a[j];
           if(sum>x)
           {
               while(sum>x)
               {
                   ans=min(ans,j-i+1);
                   sum-=a[i];
                   i++;
               }
           }
           j++;

       }
       return ans;
    }