Cod sursa(job #744747)
Utilizator | Data | 9 mai 2012 16:20:29 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
#include<iostream>
#include<fstream>
#include<algorithm>
using namespace std;
int a[3][10001];
int main ()
{
ifstream f("rucsac.in");
ofstream h("rucsac.out");
int i,j,G,n,p,g,mat=2;
f>>n>>G;
for(i=1;i<=n;++i)
{
f>>g>>p;
for(j=1;j<=G;++j)
{
a[3-mat][j]=a[mat][j];
if(j>=g)
a[3-mat][j]=max(a[3-mat][j],a[mat][j-g]+p);
}
mat=3-mat;
}
h<<a[mat][G]<<"\n";
f.close();
h.close();
return 0;
}