Cod sursa(job #1118323)
| Utilizator | Data | 24 februarie 2014 10:13:28 | |
|---|---|---|---|
| Problema | Problema rucsacului | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.46 kb |
#include <fstream>
using namespace std;
ifstream in("rucsac.in");
ofstream out("rucsac.out");
int n, g, i, j, f[2][10001], w[10001], p[10001], k=0;
int main()
{
in>>n>>g;
for(i=1;i<=n;i++)
{
k=1-k;
in>>w[i]>>p[i];
for(j=1;j<=g;j++)
{
f[k][j]=f[1-k][j];
if(f[1-k][j-w[i]]+p[i]>f[k][j] && w[i]<=j) f[k][j]=f[1-k][j-w[i]]+p[i];
}
}
out<<f[k][g];
return 0;
}
