Pagini recente » Cod sursa (job #284691) | Cod sursa (job #2336583) | Cod sursa (job #1684827) | Cod sursa (job #2468970) | Cod sursa (job #2046921)
#include <iostream>
#include <fstream>
#include <algorithm>
#include <climits>
using namespace std;
ifstream fin("energii.in");
ofstream fout("energii.out");
int e, c, d[5001], G, W;
int main()
{
fin>>G>>W;
for(int i=1;i<=10001;i++)
d[i]=2000000;
for(int i=1;i<=G;i++)
{
fin>>e>>c;
for(int j=W;j>=e;j--)
d[j]=min(d[j-e]+c,d[j]);
for(int j=e;j>=1;j--)
d[j]=min(d[j],c);
}
return 0;
}