Pagini recente » Cod sursa (job #1887903) | Cod sursa (job #87292) | Cod sursa (job #2556694) | Cod sursa (job #2385494) | Cod sursa (job #3196195)
#include <bits/stdc++.h>
using namespace std;
ifstream in ("energii.in");
ofstream out ("energii.out");
const int NMAX=1005,GMAX=5005;
int n,e;
struct pereche
{
int energie,cost;
} v[NMAX];
int dp[GMAX];
int main()
{
in>>n>>e;
for(int i=1; i<=n; i++)
{
in>>v[i].energie>>v[i].cost;
}
for(int i=0; i<=e; i++)
dp[i]=INT_MAX;
dp[0]=0;
for(int i=1; i<=n; i++)
{
for(int j=e; j>=0; j--)
{
if(dp[j]!=INT_MAX)
{
int aux=j+v[i].energie;
if(aux>e)
aux=e;
dp[aux]=min(dp[aux],dp[j]+v[i].cost);
}
}
}
if(dp[e]!=INT_MAX){
out<<dp[e];
return 0;
}
out<<-1;
return 0;
}