Cod sursa(job #2620900)
Utilizator | Nae Teodora Ioana teodora019 | Data | 29 mai 2020 20:39:49 |
---|---|---|---|
Problema | Problema rucsacului | Scor | 50 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.45 kb |
#include <fstream>
using namespace std;
ifstream cin("rucsac.in");
ofstream cout("rucsac.out");
int d[10001][10001];
int g[10001], p[10001];
int main()
{ int N, G, i, s;
cin>>N>>G;
for(i=1; i<=N; i++)
cin>>g[i]>>p[i];
for(i=1; i<=N; i++)
for(s=1; s<=G+1; s++) {
d[i][s]=d[i-1][s];
if(g[i]<=s)
d[i][s]=max(d[i][s], d[i - 1][s - g[i]]+p[i]);
}
cout<<d[N][G];
return 0;
}