Pagini recente » Cod sursa (job #379972) | Cod sursa (job #2524521) | Cod sursa (job #1367447) | Cod sursa (job #375415) | Cod sursa (job #2214957)
#include <fstream>
#include <algorithm>
using namespace std;
int v[10001];
ifstream cin ("energii.in");
ofstream cout ("energii.out");
int main()
{
int maxim = 0,n,g,a,b,i,j;
cin >> n >> g;
for(i=1; i<=g; i++)
v[i]=10000000;
for(i = 0; i < n; i++)
{
cin >> a >> b;
for(j=g; j>=0; j--)
if(j<=a)
v[j]=min(v[j],b);
else
v[j]=min(v[j-a]+b,v[j]);
}
if(v[g]==10000000)
{
cout<<"-1";
return 0;
}
cout<<v[g];
return 0;
}