Pagini recente » Cod sursa (job #839487) | Borderou de evaluare (job #1569892) | Cod sursa (job #237051) | Cod sursa (job #1711495) | Cod sursa (job #1164117)
#include <fstream>
using namespace std;
ifstream f("energii.in");
ofstream g("energii.out");
struct art { int w,c; } V[1009];
int n,W,sum,sol,dp[10001009];
int main()
{
f >> n >> W;
for(int i=1; i<=n; i++)
{
f >> V[i].w >> V[i].c;
sum += V[i].w;
}
dp[0] = 1;
for(int i=1; i<=n; i++)
{
for(int j=W; j>=0; j--)
{
if(dp[j])
{
if(dp[j+V[i].w])
{
if(dp[j+V[i].w] > dp[j] + V[i].c)
dp[j+V[i].w] = dp[j] + V[i].c;
}
else dp[j+V[i].w] = dp[j] + V[i].c;
}
}
}
if(sum < W) g << "-1\n";
else
{
sol = 2000000000;
for(int i=W; i<=sum; i++) if(dp[i] < sol && dp[i]) sol = dp[i], i = sum;
g << sol-1 << '\n';
}
g.close();
return 0;
}