Cod sursa(job #2113575)
| Utilizator | Data | 24 ianuarie 2018 19:24:59 | |
|---|---|---|---|
| Problema | Energii | Scor | 95 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.62 kb |
#include<fstream>
using namespace std;
ifstream f("energii.in");
ofstream g("energii.out");
int n, i, e, j, d[10001][10001];
pair<int, int> a[10001];
int main()
{
f>>n>>e;
//for(i=0;i<=n;i++)
for(j=0;j<=e;j++)
d[i][j]=2000000000;
for(i=1;i<=n;i++)
f>>a[i].first>>a[i].second;
for(i=1;i<=n;i++)
for(j=1;j<=e;j++)
{
d[i][j]=2000000000;
if(j>=a[i].first)
d[i][j]=min(d[i-1][j], d[i-1][j-a[i].first]+a[i].second);
else d[i][j]=min(d[i-1][j], a[i].second);
}
g<<d[n][e];
return 0;
}
