Write a solution in C++ that can do this. Use comments in the code so I can understand the solution and make sure to test it to make sure it works.

1N105 ) days that she will watch Mooloo. Because Mooloo is a paid subscription service, she now needs to decide how to minimize the amount of money she needs to pay. Mooloo has an interesting subscription system: it costs d+K(1K109) moonies to subscribe to Mooloo for d consecutive days. You can start a subscription at any time, and you can start a new subscription as many times as you desire if your curren subscription expires. Given this, figure out the minimum amount of moonies Bessie needs to pay to fulfill her schedule. INPUT FORMAT (input arrives from the terminal / stdin): The first line contains integers N and K. The second line contains N integers describing the days Bessie will watch Mooloo: 1d1