Pagini recente » Cod sursa (job #2555931) | Cod sursa (job #1445518) | Cod sursa (job #2683911) | Cod sursa (job #1397545) | Cod sursa (job #2092285)
#include <iostream>
#include <fstream>
#define INF 99999
using namespace std;
ifstream fin("energii.in");
ofstream fout("energii.out");
int main()
{
int G, W, V[1010], C[1010], S[2][1010];
fin >> G >> W;
for(int i=1;i<=G;i++)
fin >> V[i] >> C[i];
for(int j=1;j<=W;j++)
S[0][j]=C[1];
for(int i=2;i<=G;i++)
{
for(int j=1;j<=W;j++)
{
if(V[i]>j)
S[1][j]=max(C[i],S[0][j]);
else
S[1][j]=max(C[i]+S[0][j-V[i]],S[0][j]);
}
for(int j=1;j<=W;j++)
S[0][j]=S[1][j];
}
fout << S[1][W];
return 0;
}