Cod sursa(job #3125274)
| Utilizator | Data | 2 mai 2023 16:16:22 | |
|---|---|---|---|
| Problema | Problema rucsacului | Scor | 65 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.4 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream f ("rucsac.in");
ofstream g ("rucsac.out");
int d[5003], n, k, a, b, sol;
int main()
{
f >> n >> k;
while (n--)
{
f >> a >> b;
for (int i = k; i >= a; --i)
{
d[i] = max(d[i], d[i - a] + b);
sol = max(sol, d[i]);
}
}
g << sol;
return 0;
}
