-
Notifications
You must be signed in to change notification settings - Fork 0
/
knapsack.cpp
69 lines (49 loc) · 1.03 KB
/
knapsack.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
#include<stdio.h>
#include<iostream>
int max(int a,int b)
{
if(a>b) return a;
else return b;
}
int w[2002],c[2002],m[2][2002];
using namespace std;
int main()
{
int s,n,i,j;
cin>>s>>n;
for(i=1;i<=n;i++)
{
cin>>w[i]>>c[i];
}
//int sumw=0;
for(i=1;i<=n;i++)
{
//sumw=sumw+w[i];
for(j=1;j<=s;j++)
{
if(i%2)
{
if(w[i]<=j)
{
// printf("%d %d %d\n",i,j,w[i]);
m[1][j]=max(m[0][j],c[i]+m[0][j-w[i]]);
}
else m[1][j]=m[0][j];
}
else
{
if(w[i]<=j)
{
// printf("%d %d %d\n",i,j,w[i]);
m[0][j]=max(m[1][j],c[i]+m[1][j-w[i]]);
}
else m[0][j]=m[1][j];
}
}
}
//printf("%d",n&1);
if(n%2)
printf("%d\n",m[1][s]);
else
printf("%d\n",m[0][s]);
}