Pagini recente » Cod sursa (job #1143698) | Cod sursa (job #1576829) | Cod sursa (job #590172) | Cod sursa (job #2327370) | Cod sursa (job #2178418)
#include <bits/stdc++.h>
using namespace std;
int n, w, dp[5010], a[1010], b[1010];
int main(){
ifstream cin ("energii.in");
ofstream cout ("energii.out");
cin >> n >> w;
for (int i=1; i<=n; i++) cin >> a[i] >> b[i];
for (int i=1; i<=w; i++) dp[i] = 1e9;
for (int i=1; i<=n; i++){
for (int j=w; j; j--){
if (j < a[i]) dp[j] = min(dp[j], b[i]);
else dp[j] = min(dp[j - a[i]] + b[i], dp[j]);
}
}
cout << (dp[w] == 1e9? -1 : dp[w] );
return 0;
}