dp2.cpp

int dp[MAXN][MAXN]; // assign all to -1

int go(int id, int have){
	if(have < 0)
		return -inf;
	if(id > n)
		return 0;

	int &ans = dp[id][have];
	if(ans != -1)
		return ans;
	ans = 0;

	int take = 1 + go(id+1, have - c[id]);
	int dont_take = go(id + 1, have);
	ans = max({ans, take, dont_take});
	return ans;
}