Cod sursa(job #810171)
| Utilizator | Data | 9 noiembrie 2012 19:45:08 | |
|---|---|---|---|
| Problema | Problema rucsacului | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.4 kb |
#include <fstream>
using namespace std;
ifstream f("rucsac.in");
ofstream g("rucsac.out");
int n,i,j,gv,gr,c,a,b,m[3][10100];
int main()
{
f >> n >> gv;
a=1; b=2;
for(i=1;i<=n;i++)
{
f >> gr >> c;
for(j=1;j<=gv;j++)
{
if(gr<=j) m[b][j]=max(m[a][j],m[a][j-gr]+c);
else m[b][j]=m[a][j];
}
swap(a,b);
}
g << m[a][gv] << '\n';
f.close();
g.close();
return 0;
}
