Cod sursa(job #3266049)
| Utilizator | Data | 5 ianuarie 2025 15:18:42 | |
|---|---|---|---|
| Problema | Problema rucsacului | Scor | 50 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.58 kb |
#include<iostream>
#include<fstream>
using namespace std;
ifstream fin("rucsac.in");
ofstream fout("rucsac.out");
struct obiect
{
int g,c;
} v[5001];
int a[5001][10001];
int n,gmax;
int main()
{
fin>>n>>gmax;
for(int i=1; i<=n; i++)
fin>>v[i].g>>v[i].c;
for(int i=1; i<=n; i++)
for(int j=0; j<=gmax; j++)
if(v[i].g>j)
a[i][j]=a[i-1][j];
else
a[i][j]=max(a[i-1][j],a[i-1][j-v[i].g]+v[i].c);
fout<<a[n][gmax];
fin.close();
fout.close();
return 0;
}
