Pagini recente » Cod sursa (job #2448951) | Cod sursa (job #1813858) | Cod sursa (job #791710) | Cod sursa (job #995089) | Cod sursa (job #2212787)
#include <fstream>
#include <climits>
using namespace std;
ifstream fin("energii.in");
ofstream fout("energii.out");
int i,j,D[10001],E,p[10001],c[10001],n,minim,w;
int main(){
fin>>n>>E;
for(i=1;i<=n;i++)
fin>>p[i]>>c[i];
for(i=1;i<=E;i++)
D[i]=INT_MAX;
for(i=1;i<=n;i++)
for(j=E;j>=0;j--)
if(D[j]!=INT_MAX){
w=j+p[i];
if(w>E)
w=E;
D[w]=min(D[w],D[j]+c[i]);
}
if(D[E]==INT_MAX)
fout<<-1;
else
fout<<D[E];
return 0;
}