Pagini recente » Cod sursa (job #2754667) | Cod sursa (job #1680308) | Cod sursa (job #900484) | Cod sursa (job #165859) | Cod sursa (job #586924)
Cod sursa(job #586924)
#include <fstream>
using namespace std;
int d[1025][1025],c[1025],e[1025],n,total,i,j;
int main()
{
ifstream f("energii.in");
ofstream g("energii.out");
f>>n>>total;
for(int i=1;i<=n;i++)
{
f>>c[i]>>e[i];
}
for(i=1;i<=n;i++)
for(j=1;j<=total;j++)
{
if(c[i]>j) d[i][j]=d[i-1][j];
else
{
if(d[i-1][j]<e[i]+d[i-1][j-c[i]])
d[i][j]=e[i]+d[i-1][j-c[i]];
else
d[i][j]=d[i-1][j];
}
}
g<<d[n][total];
f.close();
g.close();
return 0;
}