Cod sursa(job #2978514)
| Utilizator | Data | 13 februarie 2023 20:44:29 | |
|---|---|---|---|
| Problema | Problema rucsacului | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.44 kb |
#include <bits/stdc++.h>
using namespace std;
//ifstream f("");
//ofstream g("");
int n, gmax, v[1001][10001], g[1001], s[1001];
int main()
{
cin>>n>>gmax;
for(int i=1; i<=n; i++)cin>>g[i]>>s[i];
for(int i=1; i<=n; i++)
for(int j=1; j<=gmax; j++)
{
if(j<g[i])v[i][j]=v[i-1][j];
else v[i][j]=max(v[i-1][j], v[i-1][j-g[i]]+s[i]);
}
cout<<v[n][gmax];
return 0;
}
