Pagini recente » Cod sursa (job #3141534) | Cod sursa (job #1371328) | Cod sursa (job #557655) | Cod sursa (job #2360070) | Cod sursa (job #2178412)
#include <bits/stdc++.h>
using namespace std;
int n, w, dp[1010][5010];
pair <int,int> a[1010];
#define x first
#define y second
int main(){
ifstream cin ("energii.in");
ofstream cout ("energii.out");
cin >> n >> w;
for (int i=1; i<=n; i++) cin >> a[i].x >> a[i].y;
for (int i=0; i<=n; i++){
for (int j=1; j<=w; j++) dp[i][j] = 1e9;
}
for (int i=1; i<=n; i++){
for (int j=1; j<=w; j++){
if (j < a[i].x) dp[i][j] = min(dp[i-1][j], a[i].y);
else dp[i][j] = min(dp[i-1][j - a[i].x] + a[i].y, dp[i-1][j]);
}
}
cout << (dp[n][w] == 1e9? -1 : dp[n][w] );
return 0;
}