Cod sursa(job #3164057)
Utilizator | Data | 1 noiembrie 2023 22:40:55 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.31 kb |
#include <iostream>
using namespace std;
int n,g,a[1001],b[1001],i,j;
long long int c[10001];
int main()
{
cin>>n>>g;
for(i=1;i<=n;i++)
cin>>a[i]>>b[i];
for(i=1;i<=n;i++)
for(j=g;j>=a[i];j--)
c[j]=max(c[j],c[j-a[i]]+b[i]);
cout<<c[g];
return 0;
}