← All problemsSign in

Miser gifts his date

Amit is going on a date and he wants to gift his date an array of positive numbers. But he is running short on money. He already has an array of numbers in design. **Cost of an array of numbers is the sum of elements in it**. But he wants to minimize the cost of making it. So he does the following number of operations one by one for any number of times: He chooses **two adjacent elements** ,r

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