Cod sursa(job #2174271)
Utilizator | Data | 16 martie 2018 11:25:44 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 50 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.45 kb |
#include <fstream>
using namespace std;
ifstream in("rucsac.in");
ofstream out("rucsac.out");
int n,g,w,p,a[3][1005];
int main()
{
in>>n>>g;
for(int i=1;i<=n;i++)
{
in>>w>>p;
for(int j=1;j<=g;j++)
{
if(w>j)a[2][j]=a[1][j];
else a[2][j]=max(p+a[1][j-w],a[1][j]);
}
for(int j=1;j<=g;j++)
a[1][j]=a[2][j];
}
out<<a[1][g];
return 0;
}