Pagini recente » Cod sursa (job #1956693) | Cod sursa (job #2924704) | Cod sursa (job #2507998) | Borderou de evaluare (job #1567266) | Cod sursa (job #699794)
Cod sursa(job #699794)
#include<iostream>
#include<fstream>
using namespace std;
ifstream f("energii.in");
ofstream g("energii.out");
int n, cant,e[1001], c[1001], a[10000000];
int main()
{
int i,j, max,rez;
f>>n>>cant;
for(i=1;i<=n;i++)
f>>e[i]>>c[i];
a[0]=max=0;
for(i=1;i<=n;i++)
for(j=max;j>=0;j--)
{
a[j+e[i]]=a[j]+c[i];
if(j+e[i]>max)
max=j+e[i];
}
rez=0;
for(i=1;i<=cant;i++)
if(rez<a[i])
rez=a[i];
if(rez==0)
g<<-1<<'\n';
else
g<<rez;
return 0;
}