Pagini recente » Cod sursa (job #1851386) | Cod sursa (job #1932156) | Cod sursa (job #21184) | Cod sursa (job #482179) | Cod sursa (job #2044854)
#include <fstream>
#include <algorithm>
using namespace std;
ifstream f("rucsac.in");
ofstream g("rucsac.out");
int n,G,i,ma,j,gr[5001], p[5001], b[5001];
int main()
{
f>>n>>G;
for(i=1;i<=n;++i)
f>>gr[i]>>p[i];
b[gr[1]]=p[1];
for(i=2;i<=G;++i)
{
for(j=G-gr[i];j>=1;--j)
if(b[j]>0)
if(b[gr[i]+j] <b[j]+p[i])
b[gr[i]+j]=b[j]+p[i];
if(b[gr[i]]<p[i])
b[gr[i]]=p[i];
}
ma=0;
for(i=G;i>=1;--i)
if(b[i]>ma)
ma=b[i];
g<<ma;
return 0;
}