Cod sursa(job #3348441)
| Utilizator | Data | 22 martie 2026 01:57:31 | |
|---|---|---|---|
| Problema | Problema rucsacului | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.46 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("rucsac.in");
ofstream fout("rucsac.out");
int v[10001];
int main()
{
int n, gMax, i, j;
fin >> n >> gMax;
for(i = 1; i <= n; i++)
{
int gr, pr;
fin >> gr >> pr;
for(j = gMax; j >= gr; j--)
{
if(v[j - gr] + pr > v[j])
v[j] = v[j - gr] + pr;
}
}
fout << v[gMax];
return 0;
}
