40分求调

#include <bits/stdc++.h>
#define int long long
#define endl '\n'
using namespace std;

int a[20001],n,m,s,t;

void quick(int left,int right){
	int i,j;
	i=left;
	j=right;
	int mid=left+right>>1;
	while(i<=j){
		while(a[i]<a[mid]) i++;
		while(a[j]>a[mid]) j--;
		if(i<=j){
			swap(a[i],a[j]);
			i++;
			j--;
		}	
	} 
	if(j>=left) quick(left,j);
	if(i<=right) quick(i,right);
}
signed main(){
	ios::sync_with_stdio(false);
	cin.tie(0);cout.tie(0);
	cin>>n>>m;
	for(int i=0;i<n;i++){
		cin>>a[i];
	}
	quick(0,n-1);
	for(int i=n-1;i>=0;i--){
	
		t=t+a[i];
		s++;
		if(t>m){
			cout<<s;
			break;
		}
	} 

	return 0;
}