title: Find minimum number of operations on to empty an array
body: <p>I recently faced a problem in an interview in which I was given a size of a crocodile and an array representing the size of fishes in a pond.
  The crocodile can eat the fishes less than its size and every time it eats that fish its size gets increases by the size of that fish. We can perform two types operations on the array any number of times.</p>
  
  <ol>
  <li>Remove any fish from the pond</li>
  <li>Add fish of any size to the pond</li>
  </ol>
  
  <p>Given the initial size of the crocodile and the array of fishes in the pond, we have to find the minimum no. of such operations so as to empty the array representing the pond.</p>
  
  <p>For eg -</p>
  
  <p>The initial size of the crocodile is 20 and the array of fishes is </p>
  
  <p>[10,15,20,30,100]</p>
  
  <p>In this case the crocodile eats all the fishes except the 100 and its size becomes 85 so one of the solution might be removing the fish with size 100. So the output will be 1.</p>
  
  <p>What is the best possible algorithm to implement the above problem, can it be solved recursively?</p>