No, no, No. yesterday, someone really didn't write binary enumeration

first

What is binary enumeration ？？？
Click and I will know

Gym Portal
G topic
give n Coins of different values and a total price S, Now choose as many coins as possible to be greater than or equal to S, The requirement is, for example, that the sum of the coins chosen now is sum, Then choose any coin x,sum-x Must be <S.

crap

At first, I tried my best to be greedy ,wawawawawawawawa
Mm-hmm , I'm stupid
This problem is just binary enumeration

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int t, n, s;
int maxx;
const int maxn = 100000;
int a[maxn];


int main(){
    
	scanf("%d", &t);
	while(t--){
    
		scanf("%d %d", &n, &s);
		for(int i = 0; i < n; i++){
    
			scanf("%d", &a[i]);
		}
		sort(a , a + n);
		int sum = 0;
		maxx = 0;
		bool flag = 0;
		int minn = 0x3f3f3f3f;
		int cnt = 0;
		for(int i = 0; i <= (1 << n) - 1; i++){
    
			sum = 0;
			flag = 0;
			cnt = 0;
			for(int j = 0; j < n; j++){
    
				if(i & (1 << j)){
    
					sum += a[j];
					cnt++;
					if(!flag){
    
						flag = 1;
						minn = a[j];
					}
				}
			}
			if(sum - minn < s && sum >= s){
    
				maxx = max(maxx, cnt);
			}
		}
		cout << maxx << endl;
	}
	return 0;
}```