Pagini recente » Cod sursa (job #1915391) | Cod sursa (job #1371225) | Cod sursa (job #1598635) | Cod sursa (job #1125255) | Cod sursa (job #1017661)
#include <fstream>
#include <algorithm>
#define nmax 5000+5
#define gmax 10000+5
using namespace std;
ifstream fin("rucsac.in");
ofstream fout("rucsac.out");
int N;
int G;
int W[nmax];
int P[nmax];
int C[gmax];
int indxmax;
void citire()
{
fin >> N >> G;
for (int i = 1; i <= N; i++)
fin >> W[i] >> P[i];
}
void rezolvare()
{
C[0] = 0;
for (int i = 1; i <= G; i++)
C[i] = -1;
for (int i = 1; i <= N; i++)
{
for (int j = G - W[i]; j >= 0; j--)
if (C[j] != -1)
{
C[j+W[i]] = max(C[j+W[i]],C[j]+P[i]);
if (C[j+W[i]] > C[indxmax])
indxmax = j+W[i];
}
}
}
void afisare()
{
fout << C[indxmax] << '\n';
}
int main()
{
citire();
rezolvare();
afisare();
return 0;
}