13.7 NVCC Lab: Maximize points   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. Code must be written in JAVA. Input.data 3 3 2 4 5

Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
icon
Related questions
Question

13.7 NVCC Lab: Maximize points

 

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. Code must be written in JAVA.

Input.data

3 3 2 4 5
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 3 steps

Blurred answer
Knowledge Booster
Lower bounds sorting algorithm
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Similar questions
  • SEE MORE QUESTIONS
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education