# Question Name:MILLY & CHOCOLATES

``````#include <stdio.h>

int main(){
long long int t,n,k,m,i,j,l,x,min,index;
scanf("%lld",&t);
for(i=1;i<=t;i++)
{
scanf("%lld %lld %lld",&n,&k,&m);
long long int a[n],ans[n];
for(j=0;j<n;j++)
{
scanf("%lld",&a[j]);
ans[j]=k*a[j]+m*(a[j]-1);
}
for(j=0;j<n;j++)
{
for(l=0;l<a[j];l++)
{
scanf("%lld",&x);
ans[j]=ans[j]+x;
}
}
min=1000000000000000000;
for(j=0;j<n;j++)
{
if(ans[j]<min)
{
index=j+1;
min=ans[j];
}
}
printf("%lld %lld\n",index,min);
}
return 0;
}``````
• Problem Description
Milly loves to eat chocolates. She has N different chocolates. She needs to choose only one of them. At the moment, ith chocolate already has Pi pieces. The jth piece of the ith chocolate requires Ti,j seconds to eat. Milly knows that she will take K seconds to break one piece from any chocolate and wait for M seconds after eating any piece.

Your task is to help her in selecting a chocolate that she will eat completely in minimum possible time (including the waiting time).

Input:

First line of the input will contain a single integer T denoting the number of test cases. Now for every test case, the first line will contain three space separated integers : N, K and M.

The next line will contain N space separated integers denoting Pi (The number of pieces in the ith chocolate).

Each of the next
N lines will contain j space separated integers denoting
Ti,j (Time (in seconds) required to eat jth piece of the ith chocolate.

Output:

For every test case, print two space separated integers in a new line : the index (1-based) of the resultant chocolate and the minimum number of seconds Milly needs to eat that chocolate. If multiple answers are possible then consider the lowest indexed chocolate.

Constraints:

1<=T<=10
1<=N<=10^3
1<=K,M<=10^5
1<=Pi<=100
1<=Ti,j<=10^9
• Test Case 1
Input (stdin)1
2 10 10
1 2
10
4 2
Expected Output1 20
• Test Case 2
Input (stdin)1
2 10 20
1 2
10
3 3
Expected Output1 20  