Cod sursa(job #2795078)
Utilizator | Ciocioiu Mihnea mihnea03 | Data | 5 noiembrie 2021 22:26:18 |
---|---|---|---|
Problema | Problema rucsacului | Scor | 65 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.54 kb |
#include<stdio.h>
#include <algorithm>
#define dim 10010
using namespace std;
int d[2][dim];
int i,j,n,m,c,x,y;
int main() {
freopen("rucsac.in", "r", stdin);
freopen("rucsac.out", "w", stdout);
scanf("%d %d", &n, &m);
for (i=1;i<=n;++i) {
scanf("%d %d", &x, &y);
for (j=1;j<=m;++j) {
d[c][j]=max(d[c][j-1],d[1-c][j]);
if (j>=x) {
d[c][j]=max(d[c][j],y+d[1-c][j-x]);
}
}
c=1-c;
}
printf("%d", d[1-c][m]);
return 0;
}