Cod sursa(job #2209106)
| Utilizator | Data | 1 iunie 2018 18:48:39 | |
|---|---|---|---|
| Problema | Problema rucsacului | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.64 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("rucsac.in");
ofstream fout("rucsac.out");
int d[3][10001];
int w[5001];
int p[5001];
int N,G;
int fara,cu;
int maxi(int a, int b)
{
return a>b ? a:b;
}
int main()
{
fin>>N>>G;
for (int i=1;i<=N;i++)
fin>>w[i]>>p[i];
for (int i=1;i<=N;i++)
{
for (int j=1;j<=G;j++)
{
fara = d[1][j];
cu = j>=w[i] ? d[1][j-w[i]]+p[i] : 0;
d[2][j] = maxi(fara,cu);
}
for (int j=1;j<=G;j++)
d[1][j] = d[2][j];
}
fout<<d[1][G];
return 0;
}
