Question: Krishna loves candies a lot, so whenever he gets them, he stores them so that he can eat them later whenever he wants to. He has recently received N boxes of candies each containing Ci candies where Ci represents the total number of candies in the ith box. Krishna wants to store them in a single box. The only constraint is that he can choose any two boxes and store their joint contents in an empty box only
Question: Krishna loves candies a lot, so whenever he gets them, he stores them so that he can eat them later whenever he wants to. He has recently received N boxes of candies each containing Ci candies where Ci represents the total number of candies in the ith box. Krishna wants to store them in a single box. The only constraint is that he can choose any two boxes and store their joint contents in an empty box only
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
Related questions
Question
![Question: Krishna loves candies a lot, so whenever he gets them, he stores them so that he can
eat them later whenever he wants to.
He has recently received N boxes of candies each containing Ci candies where Ci represents the
total number of candies in the ith box. Krishna wants to store them in a single box. The only
constraint is that he can choose any two boxes and store their joint contents in an empty box
only. Assume that there are an infinite number of empty boxes available.
1
At a time he can pick up any two boxes for transferring and if both the boxes contain X and Y
number of candies respectively, then it takes him exactly X+Y seconds of time. As he is too eager
to collect all of them he has approached you to tell him the minimum time in which all the
candies can be collected.
Output Format: Print minimum time required, in seconds, for each of the test cases. Print each
output on a new line.
4
Input Format:
• The first line of input is the number of test case T
. Each test case is comprised of two inputs
• The first input of a test case is the number of boxes N
. The second input is N integers delimited by whitespace denoting the number of candies in
each box
Constraints:
• 1<T<10
• 1<N<10000
• 1 [Candies in each box] < 100009
Input:
1234
Output:
19](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F44ba76de-af0d-4898-b61f-d85a848ebf83%2Fcdad6c14-7b5a-4135-91ca-10b20f2a60db%2F6zarjl7_processed.jpeg&w=3840&q=75)
Transcribed Image Text:Question: Krishna loves candies a lot, so whenever he gets them, he stores them so that he can
eat them later whenever he wants to.
He has recently received N boxes of candies each containing Ci candies where Ci represents the
total number of candies in the ith box. Krishna wants to store them in a single box. The only
constraint is that he can choose any two boxes and store their joint contents in an empty box
only. Assume that there are an infinite number of empty boxes available.
1
At a time he can pick up any two boxes for transferring and if both the boxes contain X and Y
number of candies respectively, then it takes him exactly X+Y seconds of time. As he is too eager
to collect all of them he has approached you to tell him the minimum time in which all the
candies can be collected.
Output Format: Print minimum time required, in seconds, for each of the test cases. Print each
output on a new line.
4
Input Format:
• The first line of input is the number of test case T
. Each test case is comprised of two inputs
• The first input of a test case is the number of boxes N
. The second input is N integers delimited by whitespace denoting the number of candies in
each box
Constraints:
• 1<T<10
• 1<N<10000
• 1 [Candies in each box] < 100009
Input:
1234
Output:
19
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by step
Solved in 4 steps with 2 images
Knowledge Booster
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
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
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)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education