Cod sursa(job #2048260)
| Utilizator | Data | 25 octombrie 2017 21:14:13 | |
|---|---|---|---|
| Problema | Problema rucsacului | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.55 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f ("rucsac.in");
ofstream fo ("rucsac.out");
int w[5001],p[5001],d[2][10001];
int g,n;
void calcul()
{
int l=0,pmax=0;
for(int i=1;i<=n;i++)
{
for(int j=0;j<=g;j++)
{
d[1-l][j]=d[l][j];
if(w[i]<=j)
d[1-l][j]=max(d[1-l][j],d[l][j-w[i]]+p[i]);
}
l=1-l;
}
fo<<d[l][g];
}
int main()
{
f>>n>>g;
for(int i=1;i<=n;i++)
f>>w[i]>>p[i];
calcul();
return 0;
}
