Pagini recente » Cod sursa (job #487935) | Cod sursa (job #2160666) | Cod sursa (job #996003) | Cod sursa (job #2999085) | Cod sursa (job #1345340)
#include <fstream>
#include <algorithm>
#include <cmath>
using namespace std;
ifstream cin("energii.in");
ofstream cout("energii.out");
int a[1005], b[1005], c[500005], i, j, n, p, s=0, g, w, mx;
bool u[500005];
int main()
{
cin>>n>>w;
mx=0;
for (i=1; i<=n; ++i)
cin>>a[i]>>b[i], mx=max(mx, a[i]);
for (i=1; i<=n; ++i)
{
for (j=w; j>0; --j)
{
if (c[j])
if (u[j+a[i]]==0 || (u[j+a[i]]==1 && c[j+a[i]]> c[j]+b[i] ))
c[j+a[i]]=c[j]+b[i], u[j+a[i]]=1;
}
if (u[j+a[i]]==0 || (u[j+a[i]]==1 && c[j+a[i]]> c[j]+b[i] ))
c[j+a[i]]=c[j]+b[i]; u[j+a[i]]=1;
}
int mn=1000000000;
for (i=w; i<=w+mx; ++i)
if (u[i]) mn=min(mn, c[i]);
if (mn==1000000000) cout<<-1;
else cout<<mn;
return 0;
}