Pagini recente » Cod sursa (job #3619) | Cod sursa (job #3251854) | Cod sursa (job #1917997) | Cod sursa (job #207279) | Cod sursa (job #1083602)
#include <fstream>
#include <cstring>
using namespace std;
ifstream is("energii.in");
ofstream os("energii.out");
int n, s;
long long suma, min1;
int p[1001], c[1001];
long long q[15005];
int main()
{
is >> n >> s;
for ( int i = 1; i <= n; ++i )
is >> p[i] >> c[i];
memset(q, -1, 15005);
q[0] = 0;
for ( int i = 1; i <= n; ++i )
{
for ( int j = suma; j > -1; --j )
if ( q[j] != -1 && q[j] + c[i] > q[j + p[i]] )
q[j + p[i]] = q[j] + c[i];
suma += p[i];
}
int i;
min1 = 0x3f3f3f3f;
for ( i = s; i <= suma; ++i )
if ( q[i] != -1 )
{
if ( q[i] < min1 )
min1 = q[i];
}
if ( min1 == 0x3f3f3f3f )
os << "-1";
else
os << min1;
is.close();
os.close();
return 0;
}