Pagini recente » Cod sursa (job #2764319) | Cod sursa (job #685629) | Cod sursa (job #2964730) | Cod sursa (job #24975) | Cod sursa (job #2503750)
#include <fstream>
#include <algorithm>
using namespace std;
ifstream cin("energii.in");
ofstream cout("energii.out");
struct gen{
int c,p;
}g[5001];
int n,w,dp[2][10001];
const int oo=(1<<30);
int main()
{
cin>>n>>w;
for(int i=1;i<=n;i++)
cin>>g[i].p>>g[i].c;
for(int i=1;i<=10000;i++)
dp[1][i]=dp[0][i]=oo;
for(int i=1,q=1;i<=n,q=1-q;i++)
{
for(int j=1;j<=10000;j++){
dp[q][j]=dp[1-q][j];
if(g[i].p<=j)
dp[j]=min(dp[q][j],dp[1-q][j-g[i].p]+g[i].c);
}
}
int minn=oo;
for(int i=w;i<=10000-8;i++)
minn=min(minn,dp[i]);
cout<<(minn==oo?-1 : minn);
return 0;
}