Pagini recente » Cod sursa (job #1774854) | Cod sursa (job #1470742) | Cod sursa (job #900811) | Cod sursa (job #2395157) | Cod sursa (job #2646083)
#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=0; 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;
}