Cod sursa(job #2349405)
| Utilizator | Data | 20 februarie 2019 14:11:59 | |
|---|---|---|---|
| Problema | Energii | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.56 kb |
#include <bits/stdc++.h>
#define MAXIM 10002
using namespace std;
ifstream f("energii.in");
ofstream go("energii.out");
int dp[1005][10005],g,w,e,c;
void umple()
{
for(int i=0; i<=w; i++)
dp[0][i]=MAXIM;
}
int main()
{ f>>g>>w;
umple();
for(int i=1; i<=g; i++)
{
f>>e>>c;
for(int j=0; j<=e; j++)
dp[i][j]=min(dp[i-1][j], c);
for(int j=e+1; j<=w; j++)
dp[i][j]=min(dp[i-1][j], dp[i-1][j-e]+c);
}
if(dp[g][w]!=MAXIM )
go<<dp[g][w];
else go<<-1;
return 0;
}
