Cod sursa(job #3269245)
| Utilizator | Data | 18 ianuarie 2025 14:34:40 | |
|---|---|---|---|
| Problema | Problema rucsacului | Scor | 50 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.54 kb |
#include <fstream>
using namespace std;
ifstream in("rucsac.in");
ofstream out("rucsac.out");
int castig[1001][10001], n, gr[1001], G;
int c[1001];
int main()
{
in>>n>>G;
for(int i=1; i<=n; i++)
in>>gr[i]>>c[i];
for(int i=1; i<=n; i++)
for(int j=1; j<=G; j++)
if(gr[i]<=j && castig[i-1][j-gr[i]]+c[i]>castig[i-1][j])
castig[i][j]=castig[i-1][j-gr[i]]+c[i];
else
castig[i][j]=castig[i-1][j];
out<<castig[n][G]<<'\n';
return 0;
}
