Cod sursa(job #2002085)
Utilizator | Data | 18 iulie 2017 16:26:00 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.44 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("rucsac.in");
ofstream fout("rucsac.out");
int w,p,n,g,l,a[2][10001];
int main()
{
fin>>n>>g;
l=0;
for(int i=1;i<=n;i++,l=1-l)
{
fin>>w>>p;
for(int j=0;j<=g;j++)
if(j>=w)
a[l][j]=max(a[1-l][j],p+a[1-l][j-w]);
else
a[l][j]=a[1-l][j];
}
fout<<a[1-l][g];
return 0;
}