Pagini recente » Cod sursa (job #518370) | Cod sursa (job #517226) | Cod sursa (job #1679926) | Cod sursa (job #575875) | Cod sursa (job #2505889)
#include <fstream>
using namespace std;
ifstream in("energii.in");
ofstream out("energii.out");
int n,k,e,c,dp[10001];
int main()
{ in>>n>>k;
for(int i=1;i<=k;i++)
dp[i]=2000000000;
for(int i=1;i<=n;i++)
{ in>>e>>c;
for(int j=k;j>0;j--)
{ if(j<e)
dp[j]=min(dp[j],c);
else
dp[j]=min(dp[j],dp[j-e]+c);
}
}
if(dp[k]==2000000000)
dp[k]=-1;
out<<dp[k];
in.close();
out.close();
return 0;
}