Cod sursa(job #2511303)
Utilizator | Manolachi George geo_uwu | Data | 18 decembrie 2019 18:47:13 |
---|---|---|---|
Problema | Problema rucsacului | Scor | 25 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream in("rucsac.in");
ofstream out("rucsac.out");
int n,g,i,j,k,gr[5001],pr[5001],d[10001],x;
int main()
{
in>>n>>g;
for(int i=1;i<=n;++i) in>>gr[i]>>pr[i];
d[0]=1;
for(i=1;i<=n;++i)
for(j=g;j>=0;--j)
if(j+gr[j]<g && d[j]!=0)
d[j+gr[i]]=max(d[j+gr[i]],d[j]+pr[i]);
for(int i=1;i<=g;++i) x=max(x,d[i]);
out<<x-1;
}