RPLB  Blueberries
Teresa picked up enough strawberries, now she wants to pick blueberries from the magical blueberry bush from Rainbowland.
Knowing her previous experience with the strawberries, Teresa wants to pick up the blueberries in a way that she may not exceed the limit proposed.
When picking the blueberries, she noticed that if she pick from the bush i, she couldn't pick the blueberries at the bush i+1 (some sort of magic in rainbowland).
Worried about this, Teresa wants to know the maximum blueberries she can pick, given the number of bushes and the number of blueberries in each bush.
Input
Will contain an integer T, then, T cases will follow, each case starts with a number N and K, being N the number of bushes and K the number of blueberries Teresa will pick as maximum, the next line contains N integers, each one representing the blueberries there is on the ith bush.
Output
You will output for each test case the string: “Scenario #i: “ where i is the test case you are analyzing, then, an integer denoting the maximum number of blueberries you can grab.
Example
Input: 2 5 100 50 10 20 30 40 5 87 21 45 30 12 14 Output: Scenario #1: 90 Scenario #2: 65
Output explanation (first scenario)
Teresa picks the 1^{st} blueberry bush (50), she cannot pick the 2^{nd}, she decides not to pick until the 5^{th} one where she picks the “40” blueberry, she could pick the 3^{rd} bush, but she would exceed the limit (100).
Output explanation (second scenario)
Teresa picks the 1^{st}, the 3^{rd} and the 5^{th} bush, total of (21+30+14 = 65) blueberries
CONSTRAINTS
1 <= N <= 1000
1 <= K <= 1000
hide comments
manas0008:
20170205 07:12:38
Start afresh


mkfeuhrer:
20170202 22:05:47
its just 0  1 knapsack ! ! dont thnk much :P . check print format !! 

tni_mdixit:
20170118 15:34:34
O/p format cost 2 WA . EASY! 

vengatesh15:
20161229 10:16:57
AC in 1 go :) 

Joker:
20161001 19:07:57
F**k there is a space between colon and answer


adichd123:
20160808 15:32:27
combination of two classic dp problems!! 

akashmandal21:
20160601 22:55:37
Thanks @Shashank Tiwary...ur test case helped me in finding my mistake :) 

sanjay:
20160528 17:00:40
simple BOTTOM UP DP !!!! AC in first go!!!Thanks to the author. Dont confuse after reading the problem.just think like knapsack 0/1. 

satoruu:
20160512 17:41:20
My second DP! :) 

sbansalcs:
20151025 12:31:08
Simple 01 Knapsack problem . 
Added by:  david_8k 
Date:  20120412 
Time limit:  0.439s 
Source limit:  50000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All except: ASM64 
Resource:  Own Problem used for the RPL contest 