Pagini recente » Cod sursa (job #932470) | Cod sursa (job #1140130) | Cod sursa (job #2714152) | Cod sursa (job #24248) | Cod sursa (job #2342095)
#include <fstream>
using namespace std;
ifstream in("energii.in");
ofstream out("energii.out");
int profit[10002],g[10002],p[10002];
int main()
{
int n,k,s=0;
in>>n>>k;
for(int i=1;i<=n;i++)
{in>>g[i]>>p[i];
s+=g[i];}
for(int i=1;i<=s;i++)
profit[i]=-1;
for(int i=1;i<=n;i++)
{
for(int j=s-g[i];j>=0;j--)
{
if(profit[j]!=-1 && profit[j]+p[i]>profit[j+g[i]])
profit[j+g[i]]=profit[j]+p[i];
}
}
int vmax=k,vmin=100000000;
for(int i=1;i<=k;i++)
if(profit[i]>vmax && profit[i]<vmin)
{vmax=profit[i];
vmin=profit[i];
}
out<<vmax;
return 0;
}