54 人解决，79 人已尝试。
56 份提交通过，共有 100 份提交。
3.7 EMB 奖励。
单点时限: 2.0 sec
内存限制: 256 MB
Farmer John recently bought a bookshelf for cow library, but the shelf is getting filled up quite quickly, and now the only available space is at the top.
Each of the N cows (1 <= N <= 20,000) has some height of H_i (1 <=H_i <= 10,000) and a total height summed across all N cows of S.The bookshelf has a height of B (1 <= B <= S < 2,000,000,007).
To reach the top of the bookshelf taller than the tallest cow, one or more of the cows can stand on top of each other in a stack, so that their total height is the sum of each of their individual heights. This total height must be no less than the height of the bookshelf. Since more cows than necessary in the stack can be dangerous, your job is to find the set of cows that produces a stack of the smallest number of cows possible such that the stack can
reach the bookshelf.
Line 1: Two space-separated integers: N and B
Lines 2..N+1: Line i+1 contains a single integer: H_i
6 40 6 18 11 13 19 11 INPUT DETAILS: Six cows; bookshelf height 40. Cow heights fall in the range 6..19.
3 OUTPUT DETAILS: One way to reach 40 with 3 cows is 18+11+13; many others exist
54 人解决，79 人已尝试。
56 份提交通过，共有 100 份提交。
3.7 EMB 奖励。