Cod sursa(job #2467915)
Utilizator | Data | 5 octombrie 2019 10:45:35 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 65 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.35 kb |
#include<fstream>
using namespace std;
ifstream f("rucsac.in");
ofstream g("rucsac.out");
int main()
{
int N,G,pd[10001],w[5001],p[5001];
f>>N>>G;
for(int i=1;i<=N;++i)
f>>w[i]>>p[i];
for(int i=1;i<=N;++i)
for(int j=G-w[i];j>=0;--j)
pd[j+w[i]]=max(pd[j+w[i]],pd[j]+p[i]);
g<<pd[G];
return 0;
}