Cod sursa(job #1686170)
Utilizator | Data | 12 aprilie 2016 09:14:16 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("rucsac.in");
ofstream g("rucsac.out");
int n,gr,sol,d[10002],p[5002],w[5002],i,j;
int main()
{
f>>n>>gr;
for(i=1;i<=n;i++)
f>>w[i]>>p[i];
for(i=1;i<=n;i++)
for(j=gr-w[i];j>=0;j--)
{
d[j+w[i]]=max(d[j+w[i]],p[i]+d[j]);
sol=max(sol,d[j+w[i]]);
}
cout<<sol;
return 0;
}