Pagini recente » Cod sursa (job #2226902) | Cod sursa (job #2173309) | Cod sursa (job #697682) | Cod sursa (job #2709065) | Cod sursa (job #2354379)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("energii.in");
ofstream fout("energii.out");
int c[1005][10005];
int p[1005],g[1005],G,n,maxi=0;
void citire()
{
fin>>n>>G;
for(int i=1;i<=n;++i)
{
fin>>g[i]>>p[i];
}
}
void pd()
{
int i,j;
for(i=1;i<=n;++i)
for(j=1;j<=G;++j)
{
if(g[i]>j) c[i][j]=c[i-1][j];
else
c[i][j]=max(c[i-1][j] , c[i-1][j-g[i]]+p[i]);
if(c[i][j]>maxi) maxi=c[i][j];
}
fout<<maxi;
}
int main()
{
citire();
pd();
return 0;
}