I possess a list of nested recipes, similar to the example provided below:

1. Mac n Cheese with Nuggets (gives 95 energy point)
   a) 2x Noodles
   b) 1x Ketchup
   c) 1x Oil
   d) 1x Chicken pieces
   e) 1x cheese

2. Ketchup (gives 20 energy point)
   a) 1x onion
   b) 1x tomato
   c) 1x sugar

3. noodles (gives 25 energy point)
   a) 1x milk
   b) 1x egg
   c) 1x flour

4. cheeseburger & potato (gives 50 energy point)
   a) 1x burger
   b) 1x cheese
   c) 1x oil
   d) 2x potato

those may not be real but just an example.

Suppose I have a list of ingredients in my inventory, and I’m aware of the prices for any missing ingredients in the flea market, where prices can fluctuate.

I require an algorithm to identify recipes with the highest energy that can be prepared with the ingredients I have on hand. Additionally, it should consider spending as less as possible to purchase any missing ingredients. We can regard the flea market spending budget as an input to the algorithm, provided by the user.

I am not sure which math can be useful here, any help is highly appreciated.

Thank you in advance

I tried looking at Knapsack problem algorithm but i doubt this is a solution https://en.wikipedia.org/wiki/Knapsack_problem#Multi-dimensional_knapsack_problem