Pagini recente » Cod sursa (job #978295) | Cod sursa (job #1716671) | Cod sursa (job #1918323) | Cod sursa (job #940541) | Cod sursa (job #1647137)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("rucsac.in");
ofstream fout("rucsac.out");
int n, g;
int G[100];
int P[100];
int V[100];
int main()
{
fin >> n >> g;
for(int i = 1; i <= n; ++i)
fin >> G[i] >> P[i];
V[0] = 1;
for(int i = 1; i <= n; ++i)
{
for(int j = g; j >= 1; --j)
{
if(j-G[i] != 0)
{
if(V[j-G[i]] != 0)
if(V[j-G[i]] + P[i] > V[j])
V[j] = V[j-G[i]] + P[i];
}
else V[j] = P[i];
}
}
fout << V[g] << ' ';
}