Pagini recente » Cod sursa (job #1951454) | Cod sursa (job #1977906) | Cod sursa (job #2250867) | Cod sursa (job #1946039) | Cod sursa (job #2557069)
#include <algorithm>
#include <fstream>
using namespace std;
ifstream f("rucsac.in");
ofstream g("rucsac.out");
int n,gmax,val[10001],t[10001],c[10001],i,j,mx,sol;
int main()
{
f>>n>>gmax;
for(i=1;i<=n;i++)
f>>t[i]>>c[i];
for(i=1;i<=n;i++)
for(j=mx;j>=0;j--)
if(val[j]+c[i]>val[j+t[i]] && j+t[i]<=gmax && (j==0 || val[j]))
{
val[j+t[i]]=val[j]+c[i];
if(j+t[i]>mx) mx=j+t[i];
}
for(i=0;i<=gmax;i++)
if(val[i]>sol) sol=val[i];
g<<sol;
}