def _input(): return map(int, input().split())
n = int(input())
m = int(input())
lst = sorted([ int(input()) for _ in range(n)]); res= 0
i=n-1
while i>=0:
res+=lst[i]
if res>=m: break
i-=1
print(n-i)
#include<bits/stdc++.h>
using namespace std;
int main() {
long long int n,m,x,usb=0;
cin>>n>>m;
vector<long long int> v;
for(long long int i=0; i<n; i++){
cin>>x;
v.push_back(x);
}
sort(v.begin(), v.end());
for(long long int i=n-1; i>=0; i--){
m-=v[i];
usb+=1;
if(m<=0)
break;
}
cout<<usb<<endl;
return 0;
}454A - Little Pony and Crystal Mine | 2A - Winner |
1622B - Berland Music | 1139B - Chocolates |
1371A - Magical Sticks | 1253A - Single Push |
706B - Interesting drink | 1265A - Beautiful String |
214A - System of Equations | 287A - IQ Test |
1108A - Two distinct points | 1064A - Make a triangle |
1245C - Constanze's Machine | 1005A - Tanya and Stairways |
1663F - In Every Generation | 1108B - Divisors of Two Integers |
1175A - From Hero to Zero | 1141A - Game 23 |
1401B - Ternary Sequence | 598A - Tricky Sum |
519A - A and B and Chess | 725B - Food on the Plane |
154B - Colliders | 127B - Canvas Frames |
107B - Basketball Team | 245A - System Administrator |
698A - Vacations | 1216B - Shooting |
368B - Sereja and Suffixes | 1665C - Tree Infection |