Pagini recente » Cod sursa (job #1976852) | Cod sursa (job #1242003) | Cod sursa (job #617670) | Cod sursa (job #1449982) | Cod sursa (job #2794261)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("rucsac.in");
ofstream fout("rucsac.out");
int n, i, gmax, j;
int C[5001][10001];
struct obiect{
int g;
int v;
}a[5001];
void rucsac()
{
for(i = 1; i <= n; i++)
{
for(j = 1; j <= gmax; j++)
{
if(a[i].g <= j && a[i].v + C[i-1][j-a[i].g] > C[i-1][j])
{
C[i][j] = a[i].v + C[i-1][j-a[i].g];
}
else
C[i][j] = C[i-1][j];
}
}
}
int main()
{
fin >> n >> gmax;
for(i = 1; i <= n; i++)
fin >> a[i].g >> a[i].v;
rucsac();
fout << C[n][gmax];
return 0;
}