Cod sursa(job #2880314)
Utilizator | Data | 29 martie 2022 16:54:50 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.5 kb |
#include<fstream>
using namespace std;
ifstream cin("rucsac.in");
ofstream cout("rucsac.out");
int g[5001],p[5001];
int dp[2][10001];
int main() {
int n,gmax;
cin>>n>>gmax;
for(int i=1; i<=n; i++)
cin>>g[i]>>p[i];
for(int i=1; i<=n; i++) {
for(int j=1; j<g[i]; j++)
dp[i%2][j]=dp[(i-1)%2][j];
for(int j=g[i]; j<=gmax; j++)
dp[i%2][j]=max(dp[(i-1)%2][j-g[i]]+p[i], dp[(i-1)%2][j]);
}
cout<<dp[n%2][gmax];
return 0;
}