题库练习 USB Flash Drives
← 上一题 下一题 →

A10094 | USB Flash Drives

时间限制1s
内存限制256MB
通过 / 提交0/0

题目描述

Sean is trying to save a large file to a USB flash drive. He has $n$ USB flash drives with capacities equal to $a_{1},a_{2},...,a_{n}$ 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.

输入格式

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<=10^{5}$ ) — the size of Sean's file.

Each of the next $n$ lines contains positive integer $a_{i}$ ( $1<=a_{i}<=1000$ ) — the sizes of USB flash drives in megabytes.

It is guaranteed that the answer exists, i. e. the sum of all $a_{i}$ is not less than $m$ .

输出格式

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

输入输出样例

输入 #1
3
5
2
1
3
输出 #1
2
输入 #2
3
6
2
3
2
输出 #2
3
输入 #3
2
5
5
10
输出 #3
1
C++ 编辑器
输入
输出