Cod sursa(job #3301199)
Utilizator | Data | 23 iunie 2025 10:02:59 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 50 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.44 kb |
#include <fstream>
using namespace std;
ifstream cin("rucsac.in");
ofstream cout("rucsac.out");
int n,gmax,a[10001][10001];
int main()
{
cin>>n>>gmax;
for (int i =1;i<=n;i++)
{
int p,w;
cin>>w>>p;
for (int j=1;j<=gmax;j++)
{
if (j>=w)
a[i][j]=max(p+a[i-1][j-w],a[i-1][j]);
else
a[i][j]=a[i-1][j];
}
}
cout<<a[n][gmax];
return 0;
}