Cod sursa(job #2466706)
Utilizator | Data | 2 octombrie 2019 20:24:03 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.37 kb |
#include<bits/stdc++.h>
using namespace std;
ifstream f("rucsac.in");
ofstream g("rucsac.out");
int n, G, pd[10001], w[5010], p[5010];
int main()
{
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;
}