4. Distinct Items There is a list of items in the shopping cart, each having a...

Transcribed Image Text:

4. Distinct Items There is a list of items in the shopping cart, each having a cost associated with it. There are n items, the cost of the ith item is / dollars and m items have already been bought represented in the array arr. Currently, there are k dollars, find the maximum number of distinct items one can have in total after purchasing any number of items from that money. Example Consider n = 10, m = 3, k=10, arr= [1, 3, 8]. So, the task is to find the maximum Solve question 4hct items which can be purchased out of 10 items within 10 dollars apart from items (1, 3, 8). At max, 2 items can be purchased apart from the given 3, let's say Item - 2 and Item - 5. Total cost = 2 + 5 = 7 which is less than 10. Let us consider three items - Item - 2, Item - 4, wwww.hackerrank.com/test/9nm47166m8p/questions/60d8/1s6e1q Search the web and Windows So, the answer is 5 (3 already purchased, and 2 purchased just now). Function Description Complete the function findMaxDistinctitems in the editor below. The function must return an integer denoting the maximum count of distinct items that can be purchased. findMaxDistinctltems has the following parameter(s): n: an integer denoting the number of items arr[m]: an integer array denoting already purchased items k: an integer denoting amount in dollars Constraints • 1≤n≤106 • 1≤m≤105 • 1 ≤k≤10⁹ earch the web and Windows Ar an integer denoting amount in Constraints • 1≤n≤106 • 1≤m≤105 • 1 ≤k≤10⁹ • 1 ≤a[i] ≤ 106 Input Format For Custom Testin Sample Case 0 ► Sample Case 1 earch the web and Windows javaonly 4. Distinct Items There is a list of items in the shopping cart, each having a cost associated with it. There are n items, the cost of the ith item is / dollars and m items have already been bought represented in the array arr. Currently, there are k dollars, find the maximum number of distinct items one can have in total after purchasing any number of items from that money. Example Consider n = 10, m = 3, k=10, arr= [1, 3, 8]. So, the task is to find the maximum Solve question 4hct items which can be purchased out of 10 items within 10 dollars apart from items (1, 3, 8). At max, 2 items can be purchased apart from the given 3, let's say Item - 2 and Item - 5. Total cost = 2 + 5 = 7 which is less than 10. Let us consider three items - Item - 2, Item - 4, wwww.hackerrank.com/test/9nm47166m8p/questions/60d8/1s6e1q Search the web and Windows So, the answer is 5 (3 already purchased, and 2 purchased just now). Function Description Complete the function findMaxDistinctitems in the editor below. The function must return an integer denoting the maximum count of distinct items that can be purchased. findMaxDistinctltems has the following parameter(s): n: an integer denoting the number of items arr[m]: an integer array denoting already purchased items k: an integer denoting amount in dollars Constraints • 1≤n≤106 • 1≤m≤105 • 1 ≤k≤10⁹ earch the web and Windows Ar an integer denoting amount in Constraints • 1≤n≤106 • 1≤m≤105 • 1 ≤k≤10⁹ • 1 ≤a[i] ≤ 106 Input Format For Custom Testin Sample Case 0 ► Sample Case 1 earch the web and Windows javaonly

Answer rating: 100% (QA)

SWIN BUR NE K2 4E 1 4 SWINBURNE UNIVERSITY OF TECHNOLOGY K SWIN BUR NE A E 4 SWINBURNE UN... View the full answer