Cod sursa(job #3363404)
| Utilizator | Data | 17 august 2026 17:06:55 | |
|---|---|---|---|
| Problema | Problema rucsacului | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.33 kb |
#include <bits/stdc++.h>
using namespace std;
int n,i,g,x,y,w,d[1002][10002];
int main()
{
cin>>n>>g;
for(i=1; i<=n; i++)
{
cin>>x>>y;
for(w=0; w<x; w++)
d[i][w]=d[i-1][w];
for(w=x; w<=g; w++)
d[i][w]=max(d[i-1][w],d[i-1][w-x]+y);
}
cout<<d[n][g];
}
