Pagini recente » Cod sursa (job #551942) | Cod sursa (job #871053) | Cod sursa (job #2399773) | Cod sursa (job #2338441) | Cod sursa (job #4228)
Cod sursa(job #4228)
#include <fstream.h>
#include <iostream.h>
#define N 20001
#define M 1001
int main()
{
int G,W,E[M],C[M],v[N]={0},c[N]={0},i,j,l,ult;
v[0]=-1;
ifstream f("energii.in");
ofstream g("energii.out");
f>>G>>W;
for(i=1;i<=G;i++)
{
f>>E[i];
f>>C[i];
}
f.close();
ult=0;
int aux,t;
for(i=1;i<=G;i++)
for(j=ult;j>=0;j--)
{
if(j==0 && v[j+E[i]]!=0 && c[j+E[i]]>C[i])
{
aux=c[j+E[i]];
c[j+E[i]]=C[i];
for(t=j+E[i]+1;t<=ult;t++)
if(v[t])
{
l=t;
while(l-v[l]>j+E[i])
l-=v[l];
if(l==j+E[i])
while(l+v[l]<=t)
{
l=l+v[l];
c[l]=c[l]-aux+C[i];
}
}
}
if(v[j]!=0 && v[j+E[i]]==0)
{
v[j+E[i]]=E[i];
c[j+E[i]]=c[j]+C[i];
ult=ult+E[i];
}
}
/* if(ult>=W)
if(c[W])
{ g<<c[W]; return 0;}
else
{
l=W+1;
while(!c[l])
l++;
g<<c[l];
return 0;
}*/
long sum=0;
for(i=1;i<=G;i++)
sum+=E[i];
int minim=c[W];
for(i=W+1;i<=sum;i++)
if(c[i]<minim);
minim=c[i];
if(minim)
g<<minim;
else
g<<-1;
g.close();
return 0;
}