Pagini recente » Cod sursa (job #2335039) | Cod sursa (job #2867839) | Cod sursa (job #1678831) | Cod sursa (job #979057) | Cod sursa (job #2914670)
#include <fstream>
using namespace std;
const int MAX_G = 1e3;
const int MAX_W = 5 * 1e3;
int dp[MAX_W + 1];
int g, w;
int main() {
ifstream fin("energii.in");
ofstream fout("energii.out");
fin >> g >> w;
for (int i = 1; i <= MAX_W; i++) {
dp[i] = (1 << 30);
}
dp[0] = 0;
for (int i = 1; i <= g; i++) {
int a, b;
fin >> a >> b;
for (int j = MAX_G; j >= a; j--) {
dp[j] = min(dp[j], dp[j - a] + b);
}
}
int answer = (1 << 30);
for (int i = w; i <= MAX_W; i++) {
answer = min(answer, dp[i]);
}
fout << answer;
return 0;
}