Pagini recente » Cod sursa (job #828527) | Cod sursa (job #3123806) | Cod sursa (job #2869082) | Cod sursa (job #2376939) | Cod sursa (job #1739252)
#include <iostream>
#include <cstdio>
#define NMAX 1001
#define WMAX 5020
using namespace std;
int N,W;
int costuri[NMAX];
int puteri[NMAX];
int dp[WMAX];
int rez = WMAX;
void citire()
{
scanf("%d%d",&N,&W);
for(int i=1;i<=N;i++)
scanf("%d%d",&costuri[i],&puteri[i]);
}
void rezolvare()
{
for(int i=costuri[1];i<=WMAX;i++)
dp[i] = puteri[1];
for(int i=2;i<=N;i++)
{
for(int j=WMAX;j>=costuri[i];j--)
{
if(dp[j]<puteri[i] + dp[j-costuri[i]])
{
dp[j] = puteri[i] + dp[j-costuri[i]];
if(dp[j]>W && dp[j] < rez)
rez = dp[j];
}
}
}
if(rez == WMAX)
cout<<-1;
else
cout<<rez;
}
int main()
{
freopen("energii.in","r",stdin);
freopen("energii.out","w",stdout);
citire();
rezolvare();
return 0;
}