C Program for Collecting Candies Problem (TCS Codevita) | PrepInsta
TCS CodeVita is 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 solution in C language for this problem.
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.
- 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.
- 1 < T < 10
- 1 < N< 10000
- 1 < [Candies in each box] < 100009
printf("Enter the number of test case:");
printf("Enter the number of boxes:");
printf("Enter the number of candies in each box:");
printf("Minimum time requried:");
Output 1 4 1 2 3 4 19