Cod sursa(job #2975710)
Utilizator | Data | 7 februarie 2023 10:36:00 | |
---|---|---|---|
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");
long long a[50001],gm,gr[50001],v[50001],i,j,maxim;
int n;
int main()
{
f>>n>>gm;
for(i=1;i<=n;i++)
f>>gr[i]>>v[i];
for(i=1;i<=n;i++)
for(j=gm-gr[i];j>=0;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;
}