solved-dsa-java-topicwise/Min_Sum_Partition_GFG.cpp at master · swapnil-sh/solved-dsa-java-topicwise · 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
#include <bits/stdc++.h>
using namespace std;

long long minimumSumPartition(long long a[],long long n,long long sum)
{
    bool dp[n+1][sum+1];
    int i,j,diff=0;
    for(i=0;i<n+1;i++)
    {
        for(j=0;j<sum+1;j++)
        {
            if(i==0)
                dp[i][j] = false;
            if(j==0)
                dp[i][j] = true;
        }
    }

    for(i=1;i<n+1;i++)
    {
        for(j=1;j<sum+1;j++)
        {
            if(a[i-1]>j)
                dp[i][j] = dp[i-1][j];
            else
            {
                dp[i][j] = dp[i-1][j-a[i-1]] || dp[i-1][j];
            }
        }
    }


    for(i=(sum+1)/2;i>=0;i--)
    {
        if(dp[n][i] == true)
        {
            diff = abs(sum-(2*i));
            break;
        }

    }

    return diff;
}

int main()
{

  long long t;
  cin>>t;
  while(t--)
  {

    long long n,sum=0,i;
    cin>>n;
    long long a[n];
    for(i=0;i<n;i++)
        cin>>a[i];

    for(i=0;i<n;i++)
        sum = sum+a[i];

    cout<<minimumSumPartition(a,n,sum)<<"\n";

  }
	return 0;
}