Cod sursa(job #3358687)
| Utilizator | Data | 19 iunie 2026 15:54:56 | |
|---|---|---|---|
| Problema | Problema rucsacului | Scor | 65 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.64 kb |
#include <iostream>
#include <fstream>
using namespace std;
struct obj{
int g, v;
}x[5001];
int v[5001], cv[5001];
int main()
{
ifstream fin("rucsac.in");
ofstream fout("rucsac.out");
int i, j, n, m;
fin>>n>>m;
for(i=1;i<=n;i++){
fin>>x[i].g>>x[i].v;
}
for(i=1;i<=n;i++){
for(j=1;j<=m;j++){
if(x[i].g>j){
cv[j]=v[j];
}
else{
cv[j]=max(v[j-x[i].g]+x[i].v,v[j]);
}
// cout<<cv[j]<<' ';
}
// cout<<'\n';
for(j=1;j<=m;j++){
v[j]=cv[j];
}
}
fout<<v[m]<<'\n';
return 0;
}
