← All problemsSign in

Maximise the Business of a Bakery

There are $N$ items in the bakery. Each item's cost is $cost[i]$ and the delivery charge is $delivery\_cost[i]$ for $i$ = $0$ to $N$ respectively. The chef wants to select exactly $M$ items to sell in a way that the total cost is maximised. The total cost for any set of items is `the sum of costs of those items + (minimum delivery cost among those items * total no. of items)`. Help the chef fin

HINT LADDERno hints yet
L1 Observation
L2 Technique
L3 Approach
L4 Pseudo-code
🔒
L5 Full solution
L5 unlocks only if you insist twice
solution.cppC++17

CodeSearch Tutor

Hints, not spoilers — it won’t hand over the full solution unless you insist.

voice by Sarvam AI

Sign in to chat with the tutor and save your progress.

Sign in to start