Cod sursa(job #2308086)
Utilizator | Data | 26 decembrie 2018 13:05:05 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.37 kb |
#include <fstream>
using namespace std;
ifstream cin("rucsac.in");
ofstream cout("rucsac.out");
int n, g, b[2][10001];
bool e;
int main() {
cin>>n>>g;
for(int i=1; i<=n; i++, e=!e) {
int g1, p1;
cin>>g1>>p1;
for(int j=0; j<=g; j++)
if(j<g1)
b[!e][j]=b[e][j];
else
b[!e][j]=max(b[e][j], p1+b[e][j-g1]);
}
cout<<b[e][g];
return 0;
}