Pagini recente » Cod sursa (job #2400145) | Cod sursa (job #2204028) | Cod sursa (job #2286376) | Cod sursa (job #1487863) | Cod sursa (job #2401258)
#include <fstream>
using namespace std;
const int NMAX=10000;
int d[NMAX];
ifstream fin("rucsac.in");
ofstream fout("rucsac.out");
int main()
{
int n, G, p, g, i, j, last, ans;
fin>>n>>G;
for(i=1; i<=n; i++)
d[i]=-1;
last=0;
for(i=1; i<=n; i++)
{
fin>>g>>p;
for(j=last; j>=0; j--)
if(d[j]!=-1)
{
if(j+g>G)
continue;
if(d[j]+p>d[j+p])
{
d[j+g]=d[j]+p;
if(j+g>last)
last=j+g;
}
}
}
ans=0;
for(j=G; j>=1; j--)
if(d[j]>ans)
ans=d[j];
fout<<ans;
fin.close();
fout.close();
return 0;
}