Pagini recente » Cod sursa (job #793070) | Cod sursa (job #1509401) | Cod sursa (job #207152) | Cod sursa (job #337753) | Cod sursa (job #696795)
Cod sursa(job #696795)
#include<fstream>
#include<algorithm>
#define inf 1<<30
#include<string.h>
using namespace std;
int dp[1005][5005];
int n,s;
int minim=1<<30;
ifstream in("energii.in");
ofstream out("energii.out");
void read()
{
int w,c;
in>>n>>s;
for(int i=0;i<=n;i++)
for(int j=1;j<=s;j++)
dp[i][j]=inf;
dp[0][0]=0;
for(int i=1;i<=n;i++)
{
int val=inf;
in>>w>>c;
if(w>=s && c<minim) minim=c;
else
{
for(int j=s;j>=0;j--)
{
if(j+w>s&&dp[i-1][j]!=inf)
{
if(dp[i-1][j]+c<minim) minim=dp[i-1][j]+c;
}
else if(dp[i-1][j]+c<dp[i][j+w]) dp[i][j+w]=dp[i-1][j]+c;
}
for(int k=1;k<=s;k++)
dp[i][k]=min(dp[i][k],dp[i-1][k]);
}
}
}
int main()
{
read();
if(minim==inf && dp[n][s]==inf)
out<<"-1";
else out<<min(minim,dp[n][s]);
}