Pagini recente » Borderou de evaluare (job #2037112) | Cod sursa (job #913413) | Cod sursa (job #2253595) | Istoria paginii runda/rar11 | Cod sursa (job #2428440)
#include <fstream>
#define MAX 1001 * 10002
#define INF 2e9
using namespace std;
struct
{
int energie;
int cost;
}a;
int dp[MAX];
int main()
{
int G, W, i, j, maxVal;
ifstream fin("energii.in");
ofstream fout("energii.out");
fin >> G >> W;
maxVal = 0;
for(i = 1; i < MAX; i++)dp[i] = INF;
for(i = 0; i < G; i++)
{
fin >> a.energie >> a.cost;
for(j = maxVal; j >= 0; j--)
{
if(j + a.energie < MAX && dp[j] + a.cost < dp[j + a.energie])
dp[j + a.energie] = dp[j] + a.cost;
}
if(maxVal + a.energie < MAX)maxVal += a.energie;
else maxVal = MAX - 1;
}
for(i = W; i < MAX; i++)
if(dp[i] != INF)
{
fout << dp[i];
i = MAX;
}
fin.close();
fout.close();
return 0;
}