Pagini recente » Cod sursa (job #2440421) | Cod sursa (job #561864) | Cod sursa (job #929189) | Cod sursa (job #259087) | Cod sursa (job #249872)
Cod sursa(job #249872)
#include <fstream.h>
long long n,max,e[501000],a[1002],l,p[501000],c[1002],min,E;
ifstream in("energii.in");
ofstream out("energii.out");
int main(){
int i,j,k;
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])
if(p[j+a[i]] >= p[j] + c[i] || !p[j+a[i]]){
e[j+a[i]] = a[i];
p[j+a[i]] = p[j] + c[i];
}
if(max < j+a[i])max = j+a[i];
}
min = p[E];
if(max >= E && e[max]){
min = -10000050;
for(i=E;i<=max;i++){
if(p[i] && p[i]<min) min = p[i];
}
out<<min;
}else out<<"-1";
return 0;
}