Cod sursa(job #2702151)
Utilizator | Data | 2 februarie 2021 23:43:19 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.65 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream f("rucsac.in");
ofstream g("rucsac.out");
int n, t, v[10009], rez;
bitset<10009> bif;
int main()
{
bif[0] = 1;
f >> n >> t;
for (int x, y; n; n--)
{
f >> x >> y;
for (int i = t - x; i >= 0; i--)
if (bif[i])
{
if (!bif[i + x])
{
bif[i + x] = 1;
v[i + x] = v[i] + y;
}
else
v[i + x] = max(v[i + x], v[i] + y);
rez = max(rez, v[i + x]);
}
}
g << rez;
return 0;
}