Cod sursa(job #3358706)
| Utilizator | Data | 19 iunie 2026 16:20:43 | |
|---|---|---|---|
| Problema | Problema rucsacului | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.38 kb |
#include <fstream>
using namespace std;
int dp[10001],v[10001],g[10001];
ifstream fin("rucsac.in");
ofstream fout("rucsac.out");
int main(){
int i, j, n, m;
fin>>n>>m;
for(i=1;i<=n;i++)
fin>>g[i]>>v[i];
for(i=1;i<=n;i++)
for(j=m;j>=g[i];j--)
dp[j]=max(dp[j-g[i]]+v[i],dp[j]);
fout<<dp[m]<<'\n';
return 0;
}
