laegest subset1

// A Dynamic Programming solution for subset
// sum problem+ maximal subset value.
#include<bits/stdc++.h>
using namespace std;

	// Returns size of maximum sized subset
	// if there is a subset of set[] with sun
	// equal to given sum. It returns -1 if there
	// is no subset with given sum.
	int isSubsetSum(int set[], int n, int sum)
	{
		// The value of subset[i][j] will be true if there
		// is a subset of set[0..j-1] with sum equal to i
		bool subset[sum + 1][n + 1];
		int count[sum + 1][n + 1];

		// If sum is 0, then answer is true
		for (int i = 0; i <= n; i++)
		{
			subset[0][i] = true;
			count[0][i] = 0;
		}

		// If sum is not 0 and set is empty,
		// then answer is false
		for (int i = 1; i <= sum; i++)
		{
			subset[i][0] = false;
			count[i][0] = -1;
		}

		// Fill the subset table in bottom up manner
		for (int i = 1; i <= sum; i++)
		{
			for (int j = 1; j <= n; j++)
			{
				subset[i][j] = subset[i][j - 1];
				count[i][j] = count[i][j - 1];
				if (i >= set[j - 1])
				{
					subset[i][j] = subset[i][j] ||
								subset[i - set[j - 1]][j - 1];

					if (subset[i][j])
						count[i][j] = max(count[i][j - 1],
									count[i - set[j - 1]][j - 1] + 1);
				}
			}
		}

		return count[sum][n];
	}

// Driver code
int main()
{
	int set[] = { 1,2, 3,4, 5,6,7 };
	int sum = 20;
	int n = 7;
	cout<< isSubsetSum(set, n, sum);
}

// This code is contributed by DrRoot_