Cod sursa(job #2068457)
Utilizator | Data | 17 noiembrie 2017 22:01:31 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.4 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("rucsac.in");
ofstream fout("rucsac.out");
int n, g, w[5005], p[5005];
long long v[10002];
int main()
{
int i, j;
fin>>n>>g;
for(i=1; i<=n; i++)
fin>>w[i]>>p[i];
for(i=1; i<=n; i++)
for(j=g; j>=w[i]; j--)
v[j]=max(v[j],v[j-w[i]]+(long long)p[i]);
fout<<v[g]<<'\n';
return 0;
}