附代码

#include<iostream>
#include<cstdio>
#include<algorithm>
using namespace std;

const int N = 100010;

long long n, a[N], w;
long long t, num;

int main ()
{
	cin >> n; 
	for (long long i = 0; i < n ; i ++ )
		cin >> a[i];
	
	sort(a, a + n);
	
	cin >> w;
	
	if (w < a[0]) {cout << 0 << endl; return 0;}
	if (w < a[1]) {cout << 1 << endl; return 0;}
	t = n;
	
	for (long long i = n - 1; i >= 0; i -- )
		if (a[i] <= w) {t = a[i]; break;}
		
	for (long long i = 0; i < n ; i ++ )
	{
		if (t < a[i]) break;
		
		t -= a[i];
		num ++;
	}
	
	cout << num << endl;
	return 0;
}