Pagini recente » Cod sursa (job #1645029) | Cod sursa (job #2510974) | Cod sursa (job #2782768) | Cod sursa (job #2900093) | Cod sursa (job #3184563)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("rucsac.in");
ofstream fout("rucsac.out");
int m[10001][5001];
int gmax, n;
int v[10001], g[10001];
int maxx = 0;
int main()
{
fin>>n>>gmax;
for(int i = 1; i<=n; i++){
fin>>g[i]>>v[i];
}
for(int i = 0; i<gmax; i++){
m[0][i] = 0;
}
for(int i = 0; i<n; i++){
m[i][0] = 0;
}
for(int i = 1; i<=n; i++){
for(int j = 1; j<=gmax; j++){
m[i][j] = m[i-1][j];
if(j-g[i]>=0){
m[i][j] = max(m[i-1][j], m[i-1][j-g[i]]+v[i]);
}
maxx = max(m[i][j], maxx);
// cout<<m[i][j]<<' ';
}
// cout<<'\n';
}
fout<<maxx;
return 0;
}