Pagini recente » Cod sursa (job #2401010) | Cod sursa (job #2631337) | Cod sursa (job #707911) | Cod sursa (job #276425) | Cod sursa (job #2551914)
#include <iostream>
#include <fstream>
using namespace std;
int n,s,d[10005][10005],e[5005],c[5005],i,j;
ifstream in("energii.in");
ofstream out("energii.out");
int main()
{
in>>n>>s;
for (i=1;i<=n;i++)
{
in>>e[i]>>c[i];
}
for (i=1;i<=n;i++)
for (j=0;j<=s;j++)
{
d[i][j]=d[i-1][j];
if (e[i]<=s)
d[i][j]=max(d[i][j],d[i-1][j+e[i]]+c[i]);
}
out<<d[n][s];
}