Pagini recente » Cod sursa (job #438587) | Cod sursa (job #2889361) | Cod sursa (job #458962) | Cod sursa (job #2563011) | Cod sursa (job #1551516)
#include <bits/stdc++.h>
#define nmax 5004
#define nnn 10004
using namespace std;
ifstream fin("rucsac.in");
ofstream fout("rucsac.out");
int g[nmax], c[nmax], n;
int d[2][nnn], L0, L1, G;
void Citire()
{
int i;
fin >> n >> G;
for (i=1; i<=n; i++)
fin >> g[i] >> c[i];
}
void Rezolva()
{
int i, j, maxim;
L0 = 0; L1 = 1;
/// initializari
d[L0][g[1]] = c[1];
for (i=2; i<=n; i++)
{
for (j=0; j<=G; j++)
{
d[L1][j] = d[L0][j];
if (g[i] <= j)
d[L1][j] = max(d[L1][j], d[L0][j - g[i]] + c[i]);
}
L0 = 1 - L0;
L1 = 1 - L1;
}
}
void Afisare()
{
int i, j;
int maxim;
maxim = -100;
for (j=0; j<=G; j++)
maxim = max(maxim, d[L0][j]);
fout << maxim << "\n";
}
int main ()
{
Citire();
Rezolva();
Afisare();
fin.close();
fout.close();
return 0;
}