Pagini recente » Cod sursa (job #1341674) | Cod sursa (job #2114134) | Cod sursa (job #2362808) | Cod sursa (job #1844267) | Cod sursa (job #1253022)
#include <fstream>
using namespace std;
int p[1007],c[5007],pr[5007],cur[5007],n;
int main(){
int i,j,g,q;
ifstream fin("energii.in");
ofstream fout("energii.out");
fin>>n>>g;
for(i=1;i<=n;i++)
fin >>p[i]>>c[i];
for(i=1;i<=g;i++) pr[i]=1000000;
for(i=1;i<=n;i++){
for(j=1;j<=g;j++)
if(p[i] >= j)
cur[j]= min(c[i],pr[j]);
else
cur[j] = min(pr[j],pr[j-p[i]]+c[i]);
for(q=1;q<=g;q++)
pr[q]=cur[q];
}
if(cur[g] == 1000000) fout<<"-1\n";
else
fout <<cur[g]<<"\n";
fin.close();
fout.close();
return 0;
}