Cod sursa(job #1781670)
Utilizator | Data | 17 octombrie 2016 10:33:27 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 65 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include<fstream>
using namespace std;
ifstream f("rucsac.in");
ofstream g("rucsac.out");
int v[5001];
int n,gr, w[10001],p[10001];
int rucsac()
{
int i,j;
for(i=1;i<=n;++i)
for(j=gr;j>=w[i];j--)
v[j]=max(v[j],v[j-w[i]]+p[i]);
return v[gr];
}
int main()
{
f>>n>>gr;
for(int i=1;i<=n;++i)
f>>w[i]>>p[i];
int k=rucsac();
g<<k;
}