Pagini recente » Cod sursa (job #1099154) | Istoria paginii runda/winners26 | Cod sursa (job #709059) | Cod sursa (job #709992) | Cod sursa (job #1377329)
#include <iostream>
#include <fstream>
using namespace std;
int a[100001], b[50001], c[50001], ok, m, n, i, p, q, sol;
int main()
{
ifstream fin("rucsac.in");
ofstream fout("rucsac.out");
fin>>n>>m;
for(i=1; i<=n; i++)
{
fin>>b[i]>>c[i];
}
a[0]=0;
for(i=1; i<=n; i++)
{
for(q=m-b[i]; q>=0; q--)
{
if(a[q+b[i]]<a[q]+c[i]) a[q+b[i]]=a[q]+c[i];
if(a[q+b[i]]>sol) sol=a[q+b[i]];
}
}
fout<<sol;
return 0;
}