Pagini recente » Cod sursa (job #1902139) | Cod sursa (job #2634243) | Cod sursa (job #1013932) | Cod sursa (job #2741881) | Cod sursa (job #1249651)
#include <fstream>
#include <cstring>
#include <algorithm>
#define M 1000002
#define INF 0x3f3f3f3f
using namespace std;
ifstream is("energii.in");
ofstream os("energii.out");
int n, w, e, c, s;
int mn = INF;
int d[M]; // d[i] = costul minim pt cantitatea i de energie
int main()
{
is >> n >> w;
memset(d, 63, sizeof(d));
d[0] = 0;
for ( int i = 1; i <= n; ++i )
{
is >> e >> c;
s += e;
for ( int j = s-e; j >= 0; --j )
if ( d[j+e] > d[j] + c )
d[j+e] = d[j] + c;
}
for ( int i = w; i < s; ++i )
mn = min(mn, d[i] );
os << mn;
is.close();
os.close();
return 0;
}