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

* Line 1: A single integer representing the size of the smallest set of cows that can reach the bookshelf.

6 40
6
18
11
13
19
11

3

 1 #include<iostream>
 2 #include<cstdio>
 3 #include<algorithm>
 4 
 5 using namespace std;
 6 
 7 bool cmp(int a,int b)
 8 {
 9     return a>b;
10 }
11 
12 int main()
13 {
14     int n,b;
15     int cow[20010];
16 
17     while(scanf("%d %d",&n,&b)==2)
18     {
19         for(int i=0;i<n;i++)
20             scanf("%d",&cow[i]);
21 
22         sort(cow,cow+n,cmp);
23 
24         int ans,sum=0;
25         for(ans=0;sum<b;ans++)
26             sum+=cow[ans];
27 
28         printf("%d\n",ans);
29     }
30 
31     return 0;
32 }