coding_solutions/Minimum Subset Sum Difference.cpp at master · rs1820/coding_solutions · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int subsetsum(int ar[],int n,long sum)
{

			bool dp[n+1][sum+1];
			int i,j;
			for(i=1;i<sum+1;i++)
			{
				dp[0][i]=false;
			}
			for(i=0;i<n+1;i++)
			{
				dp[i][0]=true;
			}
			dp[0][0]=true;
			for(i=1;i<=n;i++)
			{
				for(j=1;j<=sum;j++)
				{
						dp[i][j]=dp[i-1][j];

					if(ar[i-1]<=j)
					{
						dp[i][j]=dp[i-1][j-ar[i-1]] | dp[i][j];
					}


				}

			}
			vector<int> v;


			for(i=(sum)/2;i>=0;i--)
			{
				if(dp[n][i]==true)
				{
				v.push_back(i);
				}

			}
			int min1=INT_MAX;
			long range=sum;
			for(i=0;i<v.size();i++)
			{
				if(min1>range-2*v[i])
				{
					min1=range-2*v[i];

				}

			}
			return min1;

}


int main()
{
	int t;
	cin>>t;
	while(t--)
	{
			int n,w;
			cin>>n;
			int ar[n];
			long  i,j,sum=0;
			for(i=0;i<n;i++)
			{
				cin>>ar[i];
				sum=sum+ar[i];
			}
			cout<<subsetsum(ar,n,sum);
			cout<<endl;
	}
	return 0;
}