There are N bags of marbles. The number of marbles in each bag may be different. When you take a marble out of a bag, you will earn certain amount of points, depending on the number of marbles in that bag. For example, if a bag contains K marbles, you will earn K point if you take a marble from that bag. You can take only one marble each time. Now, you are allowed to take upto M marbles in total, what is the maximum points you can earn? Input file: The first line consists of N and M. N denotes the number of marble bags and M denotes the maximum number of marbles you can take out from those bags. Next line consists of N space separated integers X1,X2,X4.... XN where Xi denotes the number of marbles initially in the ith bag. Please implement the following method: public long maxPoints(String input) For example, given the following data file, calling maxPoints("input.data") should return 13. Taking out a marble from the third bag earned 5 points, taking out one from the second bag earns 4 points, and the last marble from the third bag earns 4 points, so total points is 5+4+4=13. Input.data 33 245 455802.2226078.qx3zqy7 LAB ACTIVITY 13.7.1: NVCC Lab: Maximize points 1 import java.util.*; 2 import java.io.*; 3 4 public class Main { 5 7 8 9} public long maxPoints(String input) { /* Type your code here. */ } Main.java 0/12 Load default template...

Q: For this computer algorithms problem, you are given an N amount of cents, Then you are being asked…

A: The pseudocode is as follows:-

Q: Discuss a situation in which you would use recursive binary search. What is the stopping condition…

A: The recursive binary search is used when the data is sorted. It works by dividing the array…

Q: p.278, icon at Example 6 # 2. Suppose the odd primes 3, 5, 7, 11, 13, 17, ... in order of increasing…

A:

Q: Strassen’s algorithm is a non-recursive algorithm. True/False?      Strassen’s matrix…

A: Here in this question we have asked about strassen's algorithm..

Q: Dynamic Programming : Select the correct option :

A: In the context of dynamic programming, specifically for the weighted interval scheduling problem or…

Q: p.87, icon at Example 3 #2. Suppose we need to prove that this statement is true for all integers n,…

A: To prove the statement "If n - 5 is odd, then n is even" using the definitions of even and odd…

Q: Please help me with these fractals using recursion. Please comment each line of code

A: please check below code  don't forget rating  DrawTriangles.java package c8; import…

Q: te a program to find sum of each digit in the given number using recursion..

A: The question is about finding the sum of each digit in a given number using recursion.A digit in a…

Q: Create a limit evaluation problem that requires substitution with an answer of 1. Please show the…

A: Problem :  Evaluate the function which is sin ( x ) / x and here x approaches to 0 . The solution…

Q: You, Alice and Bob are working on recursive search algorithms and have been studying a variant of…

A: Introduction : Trinary search is a decrease and conquers algorithm that can be used to find an…

Q: Write a Python Program to solve the Fibonacci sequence using Recursion Function, problem analysis…

A: Actually, python is a easiest programming language. It is a dynamically typed programming language.