CHALLENGE!! CORRUPTION

Question

With the purpose of fight against a shadow economy a bank inculcated merging of the N accounts of a company into one. For one operation 2 accounts are merged into one and bank automatically takes its own charge fee of Р% from the new account total for this operation. What is the most funds which could remain on the company' account? Each account has maximum charge of G UAH before merging.

Input:4(it's N) 5 (P)
1000 1100 1200 1300

Output :4151.50 (sum, that can remain on the account)

Answer 1

you need to say it in more detains maria...
mathemetical interpretation is confusing..
try giving your best explaination plz

Answer 2

That is a good example of recursion.

https://code.sololearn.com/cLKxP2WbG6CF/?ref=app