ACAC

code:

#include<bits/stdc++.h>
using namespace std;
long long n,HP,hurt[100005],ans;
int main(){
    cin>>n>>HP;
    for(int i=1;i<=n;i++) cin>>hurt[i];
    sort(hurt+1,hurt+n+1);
    for(int i=1;i<=n;i++){
        if((HP-hurt[i])>0) HP-=hurt[i];
        else ans++;
    }
    cout<<ans;
    return 0;
}