CF609A.USB Flash Drives

普及/提高-

通过率：0%

AC君温馨提醒

该题目为【codeforces】题库的题目，您提交的代码将被提交至codeforces进行远程评测，并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供，我们无法保证该服务的稳定性，若提交后无反应，请等待一段时间后再进行重试。

题目描述

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
```

说明/提示

In the first example Sean needs only two 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 second.

首页