Cod sursa(job #3358700)
| Utilizator | Data | 19 iunie 2026 16:14:27 | |
|---|---|---|---|
| Problema | Problema rucsacului | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.38 kb |
#include <fstream>
using namespace std;
struct o{
int g, v;
}x[10001];
int v[10001];
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=m;j>=x[i].g;j--)
v[j]=max(v[j-x[i].g]+x[i].v,v[j]);
fout<<v[m]<<'\n';
return 0;
}
