USB Flash Drives (water problem, sort)

B-usb Flash Drives Time Limit:2000MS Memory Limit:262144KB 64bit IO Format:%I64D &%i64u Submit Status

Description

Sean is trying-save a large file to a USB flash drive. He has n USB flash drives with capacities equal to A1, A2, ..., an megabytes. The file size is equal to M megabytes.

Find the minimum number of USB flash drives needed to write Sean ' s file, if he can split the file between drives.

Input

The first line contains positive integer n (1≤n≤100)-the number of USB flash drives.

The second line contains positive integer m (1≤m≤105)-the size of Sean ' s file.

Each of the next n lines contains positive integer AI (1≤ai≤1000)-the sizes of USB flash drives in megabytes.

It is guaranteed that the answer exists, i. E. The sum of all AI was not less than M.

Output

Print the minimum number of USB flash drives to write Sean ' s file, if he can split the file between drives.

Sample Input Input

3
5
2)
1
3

Output

2

Input

3
6
2)
3
2

Output

3

Input

2
5
5
10

Output

1

Hint

The first example Sean needs only a USB flash drives-the first and the third.

In the second example Sean needs all three USB flash drives.

In the third example Sean needs only one USB flash drive and he can use any available USB Flash drive-the First or the S Econd.

Understand test instructions after the sort can.

#include <stdio.h>
#include <algorithm>
using namespace std;
int main ()
{
    int n,m,a[1005],ans=0;
    scanf ("%d%d", &n,&m);
    for (int i=0; i<n; i++)
        scanf ("%d", &a[i]);
    Sort (a,a+n);
    for (int i=n-1; i>=0; i--)
    {
        ans++;
        M-=a[i];
        if (m<=0) break
            ;
    }
    printf ("%d\n", ans);
    return 0;
}