Pagini recente » Cod sursa (job #1814251) | Cod sursa (job #2388329) | Cod sursa (job #942250) | Cod sursa (job #1051305) | Cod sursa (job #1833595)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("energii.in");
ofstream fout("energii.out");
const int oo=2000000000;
const int GMax = 1005;
const int WMax = 5005;
int DP[1005][5005], E[1005], C[5005], G,W;
void read()
{
fin>>G>>W;
for(int i=1; i<=G; ++i)
{
fin>>E[i]>>C[i];
}
for(int i=1; i<=G; ++i)
for (int j=1; j<=W; ++j)
DP[i][j]=oo;
for (int i=1; i<=E[1]; ++i)
DP[1][i]=C[1];
}
void Solve()
{
for(int i=2; i<=G; ++i)
{
for(int j=1; j<=W; ++j)
{
DP[i][j]=min(DP[i-1][j],DP[i-1][j-E[i]]+C[i]);
}
}
}
int main()
{
read();
Solve();
fout<<DP[G][W]<<"\n";
return 0;
}