Pagini recente » Borderou de evaluare (job #1988719) | Diferente pentru problema/puncte2 intre reviziile 7 si 3 | Borderou de evaluare (job #3183895) | Cod sursa (job #2333655) | Cod sursa (job #2420009)
#include <iostream>
#include <fstream>
using namespace std;
ifstream in ("rucsac.in");
ofstream out("rucsac.out");
int n, g, w[5010], p[5010], i, j, d[10010];
int main()
{
in>>n>>g;
for(i=1; i<=n; i++)
{in>>w[i]>>p[i];
for(j=g; j>=1; j--)
if(j-w[i]>=0) d[j]=max(d[j], d[j-w[i]]+p[i]);}
out<<d[g]<<'\n';
return 0;
}