Pagini recente » Cod sursa (job #1879121) | Cod sursa (job #2587366) | Cod sursa (job #1886169) | Cod sursa (job #1946977) | Cod sursa (job #1083619)
#include <fstream>
#include <cstring>
#define INF 0x3f3f3f3f
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[25005];
int main()
{
is >> n >> s;
for ( int i = 1; i <= n; ++i )
is >> p[i] >> c[i];
memset(q, -1, 0);
q[0] = 0;
for ( int i = 1; i <= n; ++i )
{
for ( int j = 15005; j > -1; --j )
if ( q[j] != -1 && q[j] + p[i] > q[j + c[i]] )
q[j + c[i]] = q[j] + p[i];
suma += c[i];
}
int i;
for ( i = 0; i <= suma; ++i )
if ( q[i] >= s )
{
os << i;
break;
}
if ( i > suma )
os << "-1";
is.close();
os.close();
return 0;
}
/*
for ( int j = suma; j > -1; --j )
if ( q[j] != INF && q[j] + c[i] < q[j + p[i]] )
q[j + p[i]] = q[j] + c[i];
suma += p[i];
*/