#include #include int sortfnc(const void *a,const void *b){ if(*(int*)a == *(int*)b){return 0;} if(*(int*)a < *(int*)b){return -1;} return 1; } int main(void){ int l,n,w[131072],i,r = 0; scanf("%d%d",&n,&l); for(i = 0;i < n;i++){scanf("%d",&w[i]);} qsort(w,n,sizeof(int),sortfnc); for(i = 0;i < n;i++){if(w[i] <= l){r++;l-=w[i];}else{break;}} printf("%d\n",r); return 0; }