Cod sursa(job #1547275)
Utilizator | Data | 9 decembrie 2015 10:27:18 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.32 kb |
#include <fstream>
using namespace std;
ifstream fin("rucsac.in");
ofstream fout("rucsac.out");
int v[10001],g[10001],p[10001];
short n,G;
int main()
{fin>>n>>G;
for(int i=1;i<=n;i++)
fin>>g[i]>>p[i];
for(int i=1;i<=n;i++)
for(int j=G;j>=g[i];j--)
v[j]=max(v[j],v[j-g[i]]+p[i]);
fout<<v[G];
return 0;
}