Pagini recente » Cod sursa (job #3246978) | Cod sursa (job #2793181) | Cod sursa (job #39323) | Cod sursa (job #2269229) | Cod sursa (job #2941919)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin ("rucsac.in");
ofstream fout ("rucsac.out");
const int NMAX=5e3+5;
const int NMAX1=1e4+5;
int dp[NMAX1];
struct elem{
int g;
int val;
}v[NMAX];
int main()
{
int n,i,j,greu,kon=0;
fin>>n>>greu;
dp[0]=0;
for(i=1;i<=n;i++)
fin>>v[i].g>>v[i].val;
for(i=1;i<=n;i++)
for(j=greu-v[i].g;j>=0;j--)
if(dp[j+v[i].g]<dp[j]+v[i].val)
{
dp[j+v[i].g]=dp[j]+v[i].val;
kon=max(kon,dp[j+v[i].g]);
}
fout<<kon;
return 0;
}