Medium

# 185. Generate Maximum revenue by selling K tickets from N windows

Objective: Given 'N' windows where each window contains certain number of tickets at each window. Price of a ticket is equal to number of tickets remaining at that window. Write an algorithm to sell 'k' tickets from these windows in such a manner so that it generates the maximum revenue.

This problem was asked in the Bloomberg for software developer position.

Example:

`Say we have 6 windows and they have 5, 1, 7, 10, 11, 9 tickets respectively.`

Sell the first ticket from window 5, since it has 11 tickets so cost will be \$11.

`Revenue after selling first ticket, MaxRevenue: 11.`

Sell the second ticket from window 4 or window 5, since they have 10 tickets each so cost will be \$10, assume we sell it from window 5.

`Revenue after selling second ticket, MaxRevenue: 21.`

Sell the third ticket from window 4, since it has 10 tickets so cost will be \$10.

`Revenue after selling second ticket, MaxRevenue: 31.`

Sell the fourth ticket from window 4,5 or 6, since they have 9 tickets each so cost will be \$10.

`Revenue after selling fourth ticket, MaxRevenue: 40.`

Approach:

```Max revenue generated by selling 5 tickets: 49