Description

Sean is trying to save a large file to a USB flash drive. He has?n?USB flash drives with capacities equal to?a₁,?a₂,?...,?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.

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?≤?10⁵) — 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.

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

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.

#include <iostream>
#include<algorithm>
using namespace std;
int a[101];
int main()
{
? ? int n;
? ? cin>>n;
? ? int m;
? ? cin>>m;


? ? ?for(int i=1;i<=n;i++)
? ? ?{
? ? ? ? ?cin>>a[i];
? ? ?}
? ? ?sort(a,a+n+1);
? ? ?int sum=0;
? ? ?int sign=0;
? ? ?for(int i=n;i>=1;i--)
? ? ?{
? ? ? ? ? ?sum+=a[i];
? ? ? ? ? ?sign++;
? ? ? ? ? ?if(sum>=m)
? ? ? ? ? ?{
? ? ? ? ? ? ? ?break;
? ? ? ? ? ?}
? ? ?}
? ? ?cout<<sign<<endl;
? ? return 0;
}

總結

以上是生活随笔為你收集整理的USB Flash Drives的全部內容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網(wǎng)站內容還不錯，歡迎將生活随笔推薦給好友。