Cod sursa(job #2879486)
Utilizator | Data | 28 martie 2022 17:19:50 | |
---|---|---|---|
Problema | Energii | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.5 kb |
#include <fstream>
using namespace std;
ifstream f("energii.in");
ofstream g("energii.out");
int n,cost,max1,i,et;
int r[5002],c[1002],e[1002];
int main()
{
f>>n; f>>cost;
for(i=1;i<=n;i++)
f>>c[i]>>e[i];
for(i=1;i<=n;i++)
{
for(et=cost;et>=0;et--)
{
if(et-c[i]>=0)
r[et]=max(r[c[i]],r[c[i]-c[i]]+e[i]);
}
}
for(i=0;i<=cost;i++)
if(r[i]>max1)
max1=r[i];
g<<max1;
return 0;
}