




'''simple docstring'''



from .prime_check import Test

Test()












'''simple docstring'''



from __future__ import annotations







def 	_UpperCamelCase       (_lowerCamelCase							:   int      ,		_lowerCamelCase							:   list[int]      ,		_lowerCamelCase							:   list[int]      ,		_lowerCamelCase							:   int		)->      int:




     '''simple docstring'''





     if counter == 0 or capacity == 0:
          return 0

     # If weight of the nth item is more than Knapsack of capacity,
     #   then this item cannot be included in the optimal solution,
     # else return the maximum of two cases:
     #   (1) nth item included
     #   (2) not included
     if weights[counter - 1] > capacity:
          return knapsack(_lowerCamelCase      ,		_lowerCamelCase      ,		_lowerCamelCase      ,		counter - 1		)
     else:
          __snake_case			    =     capacity - weights[counter - 1]
          __snake_case			    =     values[counter - 1] + knapsack(
              _lowerCamelCase      ,		_lowerCamelCase      ,		_lowerCamelCase      ,		counter - 1		)
          __snake_case			    =     knapsack(_lowerCamelCase      ,		_lowerCamelCase      ,		_lowerCamelCase      ,		counter - 1		)
          return max(_lowerCamelCase      ,		_lowerCamelCase		)


if __name__ == "__main__":
     import doctest

     doctest.testmod()






