-
Notifications
You must be signed in to change notification settings - Fork 0
/
5_01Minimumsumpartition.cpp
79 lines (68 loc) · 1.38 KB
/
5_01Minimumsumpartition.cpp
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
// { Driver Code Starts
#include <bits/stdc++.h>
using namespace std;
// } Driver Code Ends
class Solution{
public:
int mod(int x)
{
if(x<0)
return -x;
return x;
}
int minDifference(int arr[], int n) {
// Your code goes here
int sum=0;
int max1=INT_MIN;
for(int i=0;i<n;i++)
{
sum+=arr[i];
max1=max(max1,arr[i]);
}
int half=sum/2;
if(max1>half)
{
return mod(sum-max1*2);
}
sort(arr,arr+n);
vector<vector<bool>> dp(n+1,vector<bool>(sum/2+1,false));
for(int i=0;i<=n;i++)
{
for(int j=0;j<=sum/2;j++)
{
if(j==0)
dp[i][j]=true;
else if(i==0)
dp[i][j]=false;
else if(arr[i-1]>j)
dp[i][j]=dp[i-1][j];
else
dp[i][j]=dp[i-1][j] || dp[i-1][j-arr[i-1]];
}
}
max1=0;
for(int i=0;i<=sum/2;i++)
{
if(dp[n][i])
max1=i;
}
return mod(sum-2*max1);
}
};
// { Driver Code Starts.
int main()
{
int t;
cin >> t;
while (t--)
{
int n;
cin >> n;
int a[n];
for(int i = 0; i < n; i++)
cin >> a[i];
Solution ob;
cout << ob.minDifference(a, n) << "\n";
}
return 0;
} // } Driver Code Ends