Problem Statement

Receipt Printing Optimization Problem Description Uber is a virtual accounting system, each trip generates a receipt that must be printed and archived. Uber offers n types of receipt paper packs, where each pack type i contains 2 i receipt sheets and costs paperCost[i] units. The finance team is expected to print at least requiredReceipts number of trip receipts. They can purchase any number of paper packs of any type, even multiple packs of the same type, while minimizing the total cost. Implement a function that chooses the most cost-effective combination of paper packs such that they have at least the required number of receipt 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. long getMini