There is a huge road. Given are the following

• Array D that stores the distance from a starting point where billboard can be installed.
• Array C that stores the profit. C[i] -> profit if the billboard is installed at distance D[i].
• dist -> minimum distance to maintain between the billboards.

Assume you can install any number of billboards while maintaining a given minimum distance 'dist' between each of them. Find the maximum profit you can achieve.