Cod sursa(job #2602945)
Utilizator | Data | 18 aprilie 2020 11:04:33 | |
---|---|---|---|
Problema | Energii | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.36 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("energii.in");
ofstream fout("energii.out");
int w[10005], n, G, i, j, p, g;
int main()
{
fin >> n >> G;
for(i = 1; i <= n; ++ i)
{
fin >> p >> g;
for(j = G; j >= p; j --)
w[j] = max(w[j], w[j - p] + g);
}
fout << w[G];
return 0;
}