Pagini recente » Cod sursa (job #677591) | Cod sursa (job #264868) | Cod sursa (job #1953491) | Cod sursa (job #2485849) | Cod sursa (job #2047984)
#include <iostream>
#include <fstream>
#include <vector>
#define INF 1000000000
using namespace std;
int dp[1005][5005];
vector<pair<int,int>>v;
int main()
{
ifstream cin("energii.in");
ofstream cout("energii.out");
int n,i,w,j;
cin>>n>>w;
v.resize(n+1);
for(i=1;i<=n;i++){
cin>>v[i].first>>v[i].second;
}
for(i=1;i<=v[1].first;i++)
dp[1][i]=v[1].second;
for(i=v[1].first+1;i<=w;i++)
dp[1][i]=INF;
for(i=2;i<=n;i++){
for(j=0;j<=w;j++){
dp[i][j]=dp[i-1][j];
if(j>=v[i].first){
dp[i][j]=min(dp[i][j],dp[i-1][j-v[i].first]+v[i].second);
}
else{
dp[i][j]=min(dp[i][j],v[i].second);
}
}
}
if(dp[n][w]==INF){
cout<<-1;
return 0;
}
cout<<dp[n][w];
return 0;
}