Pagini recente » Cod sursa (job #535575) | Cod sursa (job #2648353) | Cod sursa (job #1659944) | Cod sursa (job #2324166) | Cod sursa (job #1334170)
#include <fstream>
using namespace std;
ifstream fin("energii.in");
ofstream fout("energii.out");
int cant[1001],cost[1001],v[25002500],i,j,n,w,costmax,sol,ok,st,dr,mijl;
int main()
{
fin>>n>>w;
for(i=1;i<=n;i++)
{
fin>>cant[i]>>cost[i];
costmax+=cost[i];
}
for(i=1;i<=n;i++)
{
for(j=costmax-cost[i];j>=0;j--)
{
if(v[j]+cant[i]>v[j+cost[i]])
v[j+cost[i]]=v[j]+cant[i];
}
}
st=1;
dr=costmax;
while(st<=dr)
{
mijl=(st+dr)/2;
if(v[mijl]>w)
dr=mijl-1;
else
{
if(v[mijl]==w)
{
ok=1;
sol=mijl;
dr=mijl-1;
}
else
st=mijl+1;
}
}
if(ok==1)
fout<<sol;
else
fout<<-1;
}