Pagini recente » Borderou de evaluare (job #1999530) | Cod sursa (job #1740232) | Cod sursa (job #1921555) | Cod sursa (job #1367800) | Cod sursa (job #2174178)
#include <fstream>
using namespace std;
ifstream f("rucsac.in");
ofstream g("rucsac.out");
int n,G,p,j,i,q,a[5001][10001];
int main()
{
f>>n>>G;
for(i=1;i<=n;i++)
{f>>q>>p;
if(q<=Q)
{for(j=1;j<q;j++) {a[i][j]=a[i-1][j];}
for(j=q;j<=G;j++) {a[i][j]=max(a[i-1][j],a[i-1][j-q]+p);}}
else for(j=1;j<=Q;j++) a[i][j]=a[i-1][j];
}
g<<a[n][G];
return 0;
}