Pagini recente » Cod sursa (job #1096077) | Cod sursa (job #1674500) | Profil BarosanuNumberOne | Cod sursa (job #228186) | Cod sursa (job #2342128)
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("energii.in");
ofstream out("energii.out");
const int N=5002;
int profit[10001],p[1002],c[1002];
int n,maxim=1000000,gr,cmax;
int main()
{
in>>n>>gr;
for(int i=0; i<n; ++i)
{
in>>c[i]>>p[i];
cmax=max(cmax,c[i]);
}
profit[0]=0;
for(int i=1; i<=gr+cmax; ++i) profit[i]=100000000;
for(int i=0; i<n; ++i)
{
for(int j=gr-c[i]; j>=0; --j)
if(profit[j]!=100000000 && profit[j]+p[i]<profit[j+c[i]])
profit[j+c[i]]=profit[j]+p[i];
}
for(int i=gr+1; i<=gr+cmax; ++i)
maxim=min(maxim,profit[i]);
out<<maxim;
return 0;
}