Pagini recente » Borderou de evaluare (job #2831350) | Borderou de evaluare (job #2830488) | Borderou de evaluare (job #1648962) | Cod sursa (job #2129971) | Cod sursa (job #2472469)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("rucsac.in");
ofstream g("rucsac.out");
int main()
{
int N,G,D[10010],W[5010],P[5010];
f>> N>>G;
for(int i=1;i<=N;i++)
{
f>>W[i];
f>>P[i];
}
for(int i=1;i<=N;i++)
{
for(int j=G;j>=0;j--)
if(j+W[i]<=G && D[j]+P[i]>D[j+W[i]] )
D[j+W[i]]=D[j]+P[i];
}
g<<D[G];
return 0;
}