-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathmin_ss_sum_diff.cpp
More file actions
50 lines (47 loc) · 1.16 KB
/
min_ss_sum_diff.cpp
File metadata and controls
50 lines (47 loc) · 1.16 KB
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
#include <iostream>
using namespace std;
class min_ss_sum_diff
{
public:
int subsetsum(int arr[], int sum, int n)
{
bool t[n + 1][sum + 1];
int mn = INT_MAX;
for (int i = 0; i < n + 1; i++)
{
for (int j = 0; j < sum + 1; j++)
{
if (i == 0)
t[i][j] = false;
if (j == 0)
t[i][j] = true;
}
}
for (int i = 1; i < n + 1; i++)
{
for (int j = 1; j < sum + 1; j++)
{
if (arr[i - 1] < j)
t[i][j] = t[i - 1][j - arr[i - 1]] || t[i - 1][j];
else if (arr[i - 1] > j)
t[i][j] = t[i - 1][j];
}
}
for (int j = 0; j < (sum + 1) / 2; j++)
{
if (t[n][j] == true)
mn = min(mn, sum - 2 * j);
}
return mn;
}
};
int main()
{
int arr[] = {5, 2, 12, 4, 8}, sum = 0;
int n = sizeof(arr) / sizeof(arr[0]);
for (int i = 0; i < n; i++)
sum = sum + arr[i];
min_ss_sum_diff ob;
int result = ob.subsetsum(arr, sum, n);
cout << result;
}