Cod sursa(job #2998827)
Utilizator | Data | 10 martie 2023 09:30:49 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.4 kb |
#include <fstream>
using namespace std;
ifstream f("rucsac.in");
ofstream g("rucsac.out");
int n,gmax,a[10001],gr[10001],v[10001],i,j,maxim;
int main()
{f>>n>>gmax;
for(i=1;i<=n;i++)
f>>gr[i]>>v[i];
for(i=1;i<=n;i++)
for(j=gmax-gr[i]+1;j>=1;j--)
{if(a[j+gr[i]]<a[j]+v[i])
a[j+gr[i]]=a[j]+v[i];
if(a[j+gr[i]]>maxim)
maxim=a[j+gr[i]];}
g<<maxim;
return 0;
}