- Prepare
All Platforms Programming Aptitude Syllabus Interview Preparation Interview Exp. Off Campus - Prime Video
- Prime Mock

- Interview Experience
- Prime VideoNew
- Prime Mock
- Interview Prep
- Nano Degree
- Prime Video
- Prime Mock

# Python Program for Collecting Candies Problem (TCS Codevita) | PrepInsta

**Collecting Candies Problem**

**TCS CodeVita is a coding competition organized by TCS every year, promoting Programming-As-S-Sport. It has touched many milestones Since it was launched globally in 2014, with registrations from country and overseas. Collecting Candies is one of the sample problem of TCS CodeVita competition. It is solved by using a sorting algorithm with some changes here and there, here we have provided a python solution for this problem.**

**Problem Description**

**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.

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.

**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

**Output Format: **Print minimum time required, in seconds, for each of the test cases. Print each output on a new line.

**Constraints:**

- 1 < T < 10
- 1 < N< 10000
- 1 < [Candies in each box] < 100009

S. No. | Input | Output |
---|---|---|

1 | 1 4 1 2 3 4 | 19 |

2 | 1 5 1 2 3 4 5 | 34 |

**Explanation for sample input-output 1:**

4 boxes, each containing 1, 2, 3 and 4 candies respectively.Adding 1 + 2 in a new box takes 3 seconds.Adding 3 + 3 in a new box takes 6 seconds.Adding 4 + 6 in a new box takes 10 seconds.Hence total time taken is 19 seconds. There could be other combinations also, but overall time does not go below 19 seconds.

**Explanation for sample input-output 2:**

5 boxes, each containing 1, 2, 3, 4 and 5 candies respectively.Adding 1 + 2 in a new box takes 3 seconds.Adding 3 + 3 in a new box takes 6 seconds.Adding 4 + 6 in a new box takes 10 seconds.Adding 5 + 10 in a new box takes 15 seconds.Hence total time taken is 34 seconds. There could be other combinations also, but overall time does not go below 33 seconds.

**Python Code**

T = int(input()) arr1 = [] for i in range(0, T): N = int(input()) arr = list(map(int,input().split())) arr.sort() count = arr[0] for i in range(1, len(arr)): count = count + arr[i] arr1.append(count) print(sum(arr1))

Output 1 4 1 2 3 4 19

**Collecting Candies Problem in other Languages**

## C

To find the solution of Collecting Candies problem in C Programming language click on the button below:

## C++

To find the solution of Collecting Candies problem in C++ Programming language click on the button below:

## Java

To find the solution of Collecting Candies problem in Java Programming language click on the button below:

Login/Signup to comment

Both the codes by prep insta and sukesh works fine for only for one test case and not for multiple test case. Here is my modified code.

T = int(input())

result=[]

for i in range(0, T):

arr1=[]

N = int(input())

arr = list(map(int,input().split()))

arr.sort()

count = arr[0]

for i in range(1, len(arr)):

count = count + arr[i]

arr1.append(count)

result.append(sum(arr1))

for i in result:

print(i)

2nd for loop comes under the 1st for loop. 3rd for loop is separate for printing the minimun time required in all test cases in the new line.

t = int(input())

n = int(input())

arr = 0

sum = 0

for i in range(0, n):

arr.append(int(input())

arr.sort()

for j in range(0, len(arr)):

sum = sum + int(arr[j])

print(sum)

#Here I’m tried to complete within 10 lines:)

Testcase=int(input())

Range=int(input())

List=list(map(int,input().split()))

List2=[]; ans=List[0]

for i in range(1,Range):

ans+=List[i]

List2.append(ans)

print(sum(List2))

Thanks for contributing the code Sukesh