Cod sursa(job #1150320)
Utilizator | Data | 22 martie 2014 20:42:02 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.44 kb |
#include <iostream>
#include <cstdio>
using namespace std;
int Poz[10001],G[10001],val[10001],N,Gmx,i,j;
int main()
{
freopen("rucsac.in","r",stdin);
freopen("rucsac.out","w",stdout);
cin>>N>>Gmx;
for(i=1;i<=N;i++)
cin>>Poz[i]>>G[i];
for(i=1;i<=N;i++)
{
for(j=Gmx;j>=Poz[i];j--)
{
val[j]=max(val[j],val[j-Poz[i]]+G[i]);
}
}
cout<<val[Gmx];
return 0;
}