Homework Help is Here – Start Your Trial Now!
Engineering
Computer Science
Sample Input 0 1 100 25 3 50 Sample Output 0 105

Sample Input 0 1 100 25 3 50 Sample Output 0 105

Database System Concepts
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
See similar textbooks
icon
Related questions
Question
In C++ preferably.
8:32 1 l 5G 1 Student A hackerrank.com Knapsack with profit Problem Submissions In this problem, we are given a knapsack of fixed capacity C. We are also given a list of N objects, each having a weight W(I) and profit P(I). We can put any subset of the objects into the knapsack, as long as the total weight of our selection does not exceed C. The goal is to maximize the total profit, which is the sum of the profits of each object we put into the knapsack. Contest ends hours 12 minu seconds Submissions: Example: Input: C = 3 W: 123 P: 100 5 50 Max Score: 25 Rate This Chal More Selected Items: 1 2 Explanation: Possible selections that can be put in the knapsack are: 1 with profit 100 2 with profit 5 3 with profit 50 1 and 2 with profit 105 Note that in this problem, there is no need that the some of weights be exactly C. Hence, in this example, 1 is a valid solution but since the profit is lower than the maximum, is not the final answer. Input Format First line is C. Second line is the number of objects, N. The next N lines, each line contains two numbers: the first number is the weight of an object and the second number is the profit of that object. Еxample 3 3 1 100 25 3 50 Constraints NA Output Format Print out the maximum profit. Example: for the above input 105 Sample Input 0 3 3 1 100 25 3 50 Sample Output 0 105 1 v #include <cmath> 2 include <cstdio> 3 #include <vector> 4 include <iostream> 5 #include <algorithm> 6 using namespace std; 8. 9 int main() { 10 /* Enter your code here. Read input from STDIN. Print output to STDOUT */ return 0; 11 12 }
Transcribed Image Text:8:32 1 l 5G 1 Student A hackerrank.com Knapsack with profit Problem Submissions In this problem, we are given a knapsack of fixed capacity C. We are also given a list of N objects, each having a weight W(I) and profit P(I). We can put any subset of the objects into the knapsack, as long as the total weight of our selection does not exceed C. The goal is to maximize the total profit, which is the sum of the profits of each object we put into the knapsack. Contest ends hours 12 minu seconds Submissions: Example: Input: C = 3 W: 123 P: 100 5 50 Max Score: 25 Rate This Chal More Selected Items: 1 2 Explanation: Possible selections that can be put in the knapsack are: 1 with profit 100 2 with profit 5 3 with profit 50 1 and 2 with profit 105 Note that in this problem, there is no need that the some of weights be exactly C. Hence, in this example, 1 is a valid solution but since the profit is lower than the maximum, is not the final answer. Input Format First line is C. Second line is the number of objects, N. The next N lines, each line contains two numbers: the first number is the weight of an object and the second number is the profit of that object. Еxample 3 3 1 100 25 3 50 Constraints NA Output Format Print out the maximum profit. Example: for the above input 105 Sample Input 0 3 3 1 100 25 3 50 Sample Output 0 105 1 v #include <cmath> 2 include <cstdio> 3 #include <vector> 4 include <iostream> 5 #include <algorithm> 6 using namespace std; 8. 9 int main() { 10 /* Enter your code here. Read input from STDIN. Print output to STDOUT */ return 0; 11 12 }
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 3 steps with 1 images

SEE SOLUTIONCheck out a sample Q&A here
Blurred answer
Knowledge Booster
Fundamentals of Boolean Algebra and Digital Logics
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.
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
SEE MORE TEXTBOOKS