Pagini recente » Cod sursa (job #1500490) | Cod sursa (job #630272) | Cod sursa (job #1537479) | Cod sursa (job #238407) | Cod sursa (job #2505962)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("energii.in");
ofstream fout("energii.out");
int n,gr;
int g[5001],p[10001];
int dp[2][10001];
int main()
{
in>>n>>gr;
for(int i=1; i<=n; i++)
in>>g[i]>>p[i];
for(int i=1;i<=gr;i++)
dp[0][i]=10002;
int k=1;
for(int i=1; i<=n; i++,k=1-k)
{
for(int j=1; j<=gr; j++)
{
if(g[i]<=j)
dp[k][j]=min(dp[1-k][j],dp[1-k][j-g[i]]+p[i]);
else
dp[k][j]=dp[1-k][j];
}
}
if(dp[1-k][gr]==10002)
while(dp[1-k][gr]==10002)
gr++;
out<<dp[1-k][gr];
return 0;
}