Question: [ 1 6 : 0 4 , 6 / 1 / 2 0 2 4 ] Nani: Profits John is a shopkeeper. He can buy

[16:04,6/1/2024] Nani: Profits
John is a shopkeeper. He can buy Nitems from the producer, the / of which costs cost[] He can sell the th item at sell[i] Initially, he has K dollars and O items in his shop. At any moment, his store can accommodate at most 1 item, which means he has to sell the previous item before buying the next one from the producer.
What is the maximum profit he can achieve?
Notes
He can buy and sell any number of items.
He can use the profit previously earned to buy new items.
One item can be bought and sold at most once.
Items can be bought and sold in any order and not necessarily in the order given as input
Function description
Complete the function solution). The function takes the following 4 parameters and returns the solution:
N. Represents the number of items
K. Represents the initial amount
cost Represents the cost price of items
sell. Represents the selling price of items
Input format for custom testing
Note: Use this input format if you are testing against custom input or writing code in a language where we don't provide boilerplate code
The first line contains N, denoting the number of items.
The second line contains K, denoting the initial amount.
Previous Question
Next Question
[16:07,6/1/2024] Nani: K Represents the initial amount
cost Represents the cost price of items
sell Represents the selling price of items
Input format for custom testing
Note: Use this input format if you are testing against custom input or writing code in a language where we don't provide boilerplate code
The first line contains N, denoting the number of items.
The second line contains K, denoting the initial amount.
The third line contains cost, denoting the cost price of items.
The fourth line contains sell, denoting the selling price of items.
Output format
Print an integer representing the maximum total profit.
Constraints
1< N <105
0K100
1 cost[i]<109
1 sell10
Sample input
2
50
2530
2537
sample output
7
sample input
15
22854631785698663014
75409739214937432388
sample output
186

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!