Pagini recente » Cod sursa (job #443986) | Cod sursa (job #2259730) | Cod sursa (job #719024) | Cod sursa (job #1220684) | Cod sursa (job #2284125)
#include <fstream>
#include <iostream>
using namespace std;
ifstream fin("rucsac.in");
ofstream fout("rucsac.out");
const int NMAX=10000;
int dp[NMAX+5];
int main()
{
int n, gmax, i, j, last, valmax, g, p;
fin>>n>>gmax;
for(i=1;i<=gmax;i++)
dp[i]=-1;
last=0;
valmax=0;
for(i=1;i<=n;i++)
{
fin>>g>>p;
for(j=last;j>=0;j--)
{
if(dp[j]!=-1)
{
if(j+g>gmax)
continue;
dp[j+g]=max(dp[j+g], dp[j]+p);
last=max(last, j+g);
valmax=max(valmax, dp[j+g]);
}
}
}
fout<<valmax<<"\n";
return 0;
}