Pagini recente » Cod sursa (job #1149974) | Cod sursa (job #2964793) | Cod sursa (job #2469956) | Cod sursa (job #813795) | Cod sursa (job #2203443)
#include <cstdio>
using namespace std;
const int NMAX = 5005;
int vec[NMAX];
void rezolvare()
{
int n , w ,e ,c;
scanf("%d %d",&n,&w);
for(int i = 0 ; i< w ; i++)
vec[i] = -1;
for(int i = 0 ; i < n ; i ++)
{
scanf("%d %d",&e,&c);
for(int j = w ; j > 0 ; j--)
{
if(vec[j] != -1)
{
if( j + e <= w)
{
if( vec[j+e] == -1 || vec[e+j] > c + vec[j])
vec[j+e] = c+vec[j];
}
}
else
if( vec[w]> c+vec[j] || vec[w] == -1)
vec[w] = c+ vec[j];
}
}
printf("%d ",vec[w]);
}
int main()
{
freopen("energii.in","r",stdin);
freopen("energii.out","w",stdout);
rezolvare();
return 0;
}