Pagini recente » Cod sursa (job #1359480) | Cod sursa (job #2456173) | Cod sursa (job #725778) | Cod sursa (job #1413506) | Cod sursa (job #2293494)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("energii.in");
ofstream fout("energii.out");
int a[1001][10001], n, gmax;
struct element
{
int greutate;
int pret;
}v[10001];
int main()
{
fin>>n>>gmax;
for (int k=1; k<=n; k++) fin>>v[k].greutate>>v[k].pret;
for (int i=1; i<=n; i++)
{
for (int j=1; j<=gmax; j++)
{
if (v[i].greutate<=j) a[i][j]=max(a[i-1][j], a[i-1][j-v[i].greutate]+v[i].pret);
else a[i][j]=a[i-1][j];
}
}
fout<<a[n][gmax];
return 0;
}