Cod sursa(job #2646081)
| Utilizator | Data | 30 august 2020 19:46:51 | |
|---|---|---|---|
| Problema | Energii | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.65 kb |
#include <fstream>
using namespace std;
ifstream f("energii.in");
ofstream g("energii.out");
int d[2][10001];
int e[10001],c[10001],n,w;
int main()
{
f>>n>>w;
for(int i=1; i<=n; i++)
f>>e[i]>>c[i];
for(int i=0; i<2; i++)
for(int j=1; j<=100; j++)
d[i][j]=1000001;
for(int i=1; i<=n; i++)
for(int j=1; j<=w; j++)
if(e[i]<=j)
d[i%2][j]=min(d[(i-1)%2][j],d[(i-1)%2][j-e[i]]+c[i]);
else
d[i%2][j]=min(d[(i-1)%2][j],c[i]);
if(d[n%2][w]==1000001)
g<<"-1";
else
g<<d[n%2][w];
return 0;
}
