Pagini recente » Cod sursa (job #3309600) | Cod sursa (job #2085386) | Cod sursa (job #3357900) | Cod sursa (job #3326254) | Cod sursa (job #1856288)
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("energii.in");
ofstream out("energii.out");
int d[5003];
int main()
{ int n,w,p[1003],e[1003],i,j,s=0,maxt=0;
in>>n>>w;
for(i=1;i<=n;i++){
in>>e[i]>>p[i];
}
for(i=1;i<=w;i++)
d[i]=50000;
d[0]=0;
for(i=1;i<=n;i++)
for(j=w-1;j>=0;j--){
if(d[j]!=50000){
if(j+e[i]>=w)
d[w]=min(d[w],d[j]+p[i]);
else
d[j+e[i]]=min(d[j+e[i]],d[j]+p[i]);
}
}
for(i=1;i<=w;i++)
cout<<d[i]<<" ";
out<<d[w];
return 0;
}