Cod sursa(job #1507063)
Utilizator | Data | 21 octombrie 2015 11:52:44 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 35 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.31 kb |
#include<fstream>
using namespace std;
int n,G,a,b,t[5001][10001];
ifstream f("rucsac.in");
ofstream g("rucsac.out");
int main()
{f>>n>>G;
for(int i=1;i<=n;i++)
{f>>a>>b;
for(int j=1;j<a;j++)
t[i][j]=t[i-1][j];
for(int j=a;j<=G;j++)
t[i][j]=max(t[i-1][j],t[i-1][j-a]+b);
}
g<<t[n][G];
return 0;
}