Submission #1167883

---

Source Code Expand

#include<bits/stdc++.h>
#define DEBUG 0
/*
*/

using namespace std;



int main() {
	long long int N, K;
	cin >> N >> K;
	vector<long long int>A(N);
	for (size_t i = 0; i < N; i++)
	{
		cin >> A[i];
	}
	long long int ans = 0;
	for (size_t i = 0; i < N; i++)
	{
		bool f = true;

		long long int ansxx = LLONG_MAX / 6;
		if (0 >= K - A[i])
		{
			ansxx = min(ansxx, 0LL);
		}
		set<long long int>S;
		S.insert(0);
		for (size_t j = 0; j < N; j++)
		{
			if (j != i)
			{
				set<long long int>SS = S;
				for (auto x : S) {
					if (x + A[j] < K - A[i])
					{
						SS.insert(x + A[j]);
					}
					else {
						ansxx = min(ansxx, x + A[j]);
						if (ansxx<K)
						{
							break;
						}
					}
				}
				if (ansxx<K)
				{
					break;
				}
				S = SS;
			}
		}

		//cout << ansxx << endl;
		if (ansxx >= K)
		{
			ans++;
		}
	}

	cout << ans << endl;


	if (DEBUG)
	{
		int ewataeoprgjpsrteog;
		cin >> ewataeoprgjpsrteog;
	}
}

Submission Info

Judge Result