Submission #1965592

---

Source Code Expand

#include <iostream>
#include <vector>
#include <set>
using namespace std;

typedef long long ll;

int n;
ll m;

ll p[1002];

set<ll> memo;

int main()
{
	cin >> n >> m;
	for(int i = 0;i < n;i++) cin >> p[i];
	p[n] = 0;
	p[n + 1] = 0;
	ll result = 0;
	for(int i = 0;i < n + 2;i++)
	{
		for(int j = 0;j < n + 2;j++)
		{
			if(p[i] + p[j] <= m)
			{
				memo.insert(p[i] + p[j]);
				result = max(result , p[i] + p[j]);
			}
		}
	}

	for(auto ite = memo.begin();ite != memo.end();++ite)
	{
		ll v = (*ite);

		auto low = memo.lower_bound(m - v + 1);
		if(low != memo.begin())
		{
			--low;
			result = max(result , v + (*low));
		}
	}

	cout << result << endl;
	return 0;
}

Submission Info

Judge Result