Cod sursa(job #3342937)
| Utilizator | Data | 26 februarie 2026 10:33:55 | |
|---|---|---|---|
| Problema | Problema rucsacului | Scor | 50 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.48 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("rucsac.in");
ofstream g("rucsac.out");
int n,gre,x,val,dp[5010][10010];
int main() {
f>>n>>gre;
for(int i=1; i<=n; i++) {
f>>x>>val;
for(int j=1; j<=gre; j++) {
dp[i][j]=dp[i-1][j];
if(j-x>=0) {
dp[i][j]=max(dp[i][j],dp[i-1][j-x]+val);
}
}
}
g<<dp[n][gre];
f.close();
g.close();
return 0;
}
