Pagini recente » Cod sursa (job #1888202) | Cod sursa (job #1170719) | Cod sursa (job #2442057) | Cod sursa (job #1579424) | Cod sursa (job #3328264)
#include <fstream>
#include <vector>
#include <climits>
using namespace std;
ifstream cin("energii.in");
ofstream cout("energii.out");
vector<int> energie, cost;
vector<vector<int>> dp; // energie, cost
int n, threshold;
int main() {
cin >> n >> threshold;
energie.resize(n + 1);
cost.resize(n + 1);
int s = 0;
for (int i = 1 ; i <= n ; ++i) {
cin >> energie[i] >> cost[i];
s += energie[i];
}
dp.assign(n + 1, vector<int>(s + 1, INT_MAX));
dp[0][0] = 0;
for (int i = 1 ; i <= n ; ++i) {
for (int j = 0 ; j <= s ; ++j) {
dp[i][j] = dp[i - 1][j];
if (j >= energie[i] && dp[i - 1][j - energie[i]] != INT_MAX && dp[i - 1][j - energie[i]] + cost[i] < dp[i][j])
dp[i][j] = dp[i - 1][j - energie[i]] + cost[i];
}
}
int ans = INT_MAX;
for (int i = threshold ; i <= s ; ++i) {
ans = min(ans, dp[n][i]);
}
cout << ans;
return 0;
}