Pagini recente » Cod sursa (job #1111177) | Cod sursa (job #2436605) | Cod sursa (job #1398750) | Cod sursa (job #1642594) | Cod sursa (job #249578)
Cod sursa(job #249578)
#include <fstream.h>
long long n,max,e[1002],a[1002],l,p[1002],c[1002],min,E;
ifstream in("energii.in");
ofstream out("energii.out");
int main(){
int i,j;
in>>n>>E;
for(i=1;i<=n;i++)
in>>a[i]>>c[i];
e[0] = -1;
max = 0;
for(i=1;i<=n;i++){
for(j=max;j>=0;j--)
if(e[j] && j+a[i] <= 1001)
if(p[j+a[i]] <= p[j] + c[i]){
e[j+a[i]] = a[i];
p[j+a[i]] = p[j] + c[i];
}
max = max+a[i];
}
min = p[E];
if(min){
for(i=E;i<=max;i++)
if(p[i] && p[i]<min) min = p[i];
out<<min;
}else out<<"-1";
return 0;
}