Cod sursa(job #2026010)
Utilizator | Tir Vlad Ioan Vlad3108 | Data | 23 septembrie 2017 16:08:22 |
---|---|---|---|
Problema | Problema rucsacului | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.55 kb |
#include <bits/stdc++.h>
#define LMAX 5005
using namespace std;
class Rucsac{
public:
int w,p;
}v[LMAX];
int D[2][2*LMAX];
int main(){
freopen("rucsac.in","r",stdin);
freopen("rucsac.out","w",stdout);
int n,G;
scanf("%d %d",&n,&G);
for(int i=1;i<=n;++i)
scanf("%d %d",&v[i].w,&v[i].p);
for(int i=1;i<=n;++i)
for(int j=1;j<=G;++j)
if(j<v[i].w)
D[i%2][j]=D[1-i%2][j];
else D[i%2][j]=max(D[1-i%2][j],D[1-i%2][j-v[i].w]+v[i].p);
printf("%d\n",D[n%2][G]);
}