Cod sursa(job #2148128)
Utilizator | Data | 1 martie 2018 15:43:45 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.44 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("rucsac.in");
ofstream g("rucsac.out");
int n,r,gr,cost,i,j,a[3][10005];
int main()
{
f>>n>>r;
for(i=1;i<=n;i++)
{
f>>gr>>cost;
for(j=1;j<=r;j++)
if(gr>j) a[2][j]=a[1][j];
else a[2][j]=max(cost+a[1][j-gr],a[1][j]);
for(j=1;j<=r;j++)
a[1][j]=a[2][j];
}
g<<a[1][r];
return 0;
}