Problem Statement

Receipt Printing Optimization Problem Description A ride-hailing company runs a virtual accounting system where every completed trip must have a receipt printed and filed away. The company can buy from n available types of receipt paper packs, where a pack of type i contains 2 i sheets and costs paperCost[i] units. The finance team must be able to print at least requiredReceipts trip receipts in total. They may buy any number of packs of any type, including several packs of the same type, and want to spend as little as possible. Write a function that picks the cheapest combination of paper packs that supplies at least the required number of sheets. The function getMinimumPaperCost takes the following input: int paperCost[q] : The cost of each type of paper pack. int requiredReceipts : The minimum number of receipts that must be printed. The function should return a long integer representing the minimum total cost to purchase paper packs that provide at least requiredReceipts sheets. lo