Cod sursa(job #1191782)
Utilizator | Data | 28 mai 2014 18:53:26 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.31 kb |
#include<fstream>
using namespace std;
ifstream fin("rucsac.in");
ofstream fout("rucsac.out");
int g[5001],p[5001],s[10001],i,n,G,j;
int main()
{
fin>>n>>G;
for(i=1;i<=n;i++)
fin>>g[i]>>p[i];
for(i=1;i<=n;i++)
for(j=G;j>=g[i];j--)
s[j]=max(s[j],s[j-g[i]]+p[i]);
fout<<s[G];
return 0;
}