Cod sursa(job #2308070)
Utilizator | Data | 26 decembrie 2018 12:32:57 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 50 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.44 kb |
#include <fstream>
using namespace std;
ifstream cin("rucsac.in");
ofstream cout("rucsac.out");
struct item {
int g, p;
};
int n, g, b[5001][10001];
item a[5001];
int main() {
cin>>n>>g;
for(int i=1; i<=n; i++) {
cin>>a[i].g>>a[i].p;
}
for(int i=1; i<=n; i++)
for(int j=1; j<=g; j++)
if(j<a[i].g)
b[i][j]=b[i-1][j];
else
b[i][j]=max(b[i-1][j], a[i].p+b[i-1][j-a[i].g]);
cout<<b[n][g];
return 0;
}