Write a pseudo code to solve this new stock portfolio problem

Now the following constraint is removed.

You are allowed to purchase only one stock for each company.

You can buy any number of stocks for any company. You can purchase them as long as the total cost is below the budget. e$.$g$.,$ The number of stocks can be $1,2,10\mathrm{.}12345,20,100,201\mathrm{.}345678,200000,...$

Under the new condition, describe your algorithm that maximizes the return value from a portfolio. You can simply specify the algorithm in English.