Pagini recente » Cod sursa (job #1642917) | Cod sursa (job #2566321) | Cod sursa (job #1932775) | Cod sursa (job #1091484) | Cod sursa (job #1306357)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f ("energii.in");
ofstream g ("energii.out");
const int NMAX = 1001;
const int INF = 0x7fffffff;
int n, E;
int cant[NMAX], cost[NMAX];
int dp[NMAX][NMAX]; // costul minim pentru energia i si generatorul j
void citeste() {
f >> n >> E;
for (int i = 1; i <= n; i++)
f >> cant[i] >> cost[i];
}
void rezolva() {
for (int i = 0; i <= E; i++)
for (int j = 0; j <= n; j++)
dp[i][j] = INF;
for (int i = 0; i <= n; i++) dp[0][i] = 0;
for (int i = 0; i <= E; i++)
for (int j = 1; j <= n; j++)
if(cant[j] < i)
dp[i][j] = min(dp[i][j - 1], dp[i - cant[j]][j] + cost[j]);
else
dp[i][j] = min(dp[i][j - 1], cost[j]);
g << dp[E][n];
}
int main() {
citeste();
rezolva();
}