Pagini recente » Cod sursa (job #692715) | Istoria paginii runda/pregarire_balti_oji_round1/clasament | Cod sursa (job #825141) | Cod sursa (job #2537488) | Cod sursa (job #947861)
Cod sursa(job #947861)
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
int We[5001];
int main ()
{
int i,j,dmax=0,g,w,eg,cg;
memset(We,-1,sizeof(We));
We[0]=0;
freopen("energii.in","r",stdin);
freopen("energii.out","w",stdout);
scanf("%d%d",&g,&w);
for (i=1;i<=g;i++)
{
scanf("%d%d",&eg,&cg);
for (j=dmax;j>=0;j--)
{
if (We[j]>=0)
if (We[j+cg]<We[j]+eg)
{
We[j+cg]=We[j]+eg;
if (j+cg>dmax)
dmax=j+cg;
}
}
}
dmax=min(dmax,5001);
for (i=0;i<=dmax;i++)
{
if (We[i]>=w)
{
printf("%d\n",i);
break;
}
}
return 0;
}