Pagini recente » Cod sursa (job #2940634) | Cod sursa (job #3232657) | Cod sursa (job #1975739) | Cod sursa (job #938349) | Cod sursa (job #1481000)
//
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("energii.in");
ofstream out("energii.out");
int e[2000],c[2000];
int g[1000000];
int n;
int main()
{ int i,j,w,s=0,m=0;
in>>n;
in>>w;
for(i=1;i<=n;i++)
{in>>e[i]>>c[i];
s=s+e[i];
m=m+c[i];}
if(s<w)out<<-1;
else
{for(i=1;i<=n;i++)
for(j=m;j>=0;j--)
g[j+c[i]]=max(g[j+c[i]], g[j]+e[i]);
for(i=0;i<=m;i++)
if(g[i]>=w){
out<<i;
break;
}}
return 0;
}