Cod sursa(job #2881948)
| Utilizator | Data | 31 martie 2022 00:45:14 | |
|---|---|---|---|
| Problema | Problema rucsacului | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.42 kb |
#include <fstream>
using namespace std;
ifstream f("rucsac.in");
ofstream p("rucsac.out");
long long a[50001],gmax,g[50001],val[50001],i,j,maxim;
int n;
int main()
{
f>>n>>gmax;
for(i=1;i<=n;i++)
f>>g[i]>>val[i];
for(i=1;i<=n;i++)
for(j=gmax-g[i];j>=0;j--)
{if(a[j+g[i]]<a[j]+val[i])
a[j+g[i]]=a[j]+val[i];
if(a[j+g[i]]>maxim)
maxim=a[j+g[i]];
}
p<<maxim;
return 0;
}
