Pagini recente » Cod sursa (job #3042120) | Cod sursa (job #2639247) | Cod sursa (job #1743655) | Cod sursa (job #1966192) | Cod sursa (job #2480463)
#include <bits/stdc++.h>
using namespace std;
ifstream fin ("energii.in");
ofstream fout ("energii.out");
const int N = 5005, limit = 2e9;
int power[N / 5], cost[N / 5], d[N / 5][N];
int main()
{
ios::sync_with_stdio(false);
fin.tie(0);
int n, m;
fin >> n >> m;
for(int i = 1; i <= n; ++i) fin >> power[i] >> cost[i];
for(int i = 1; i <= n; ++i) power[i] = min(power[i], m);
for(int i = 1; i <= n; ++i) {
for(int j = 1; j <= m; ++j) {
if(d[i - 1][j] > 0) d[i][j] = d[i - 1][j];
if(j >= power[i])
d[i][j] = max(d[i][j], d[i - 1][j - power[i]] + cost[i]);
}
}
int mn = -1;
for(int i = 1; i <= n; ++i) {
for(int j = 1; j <= m; ++j) {
if(d[i][j] >= m) {
if(mn == -1) mn = d[i][j];
else mn = min(mn, d[i][j]);
}
}
}
fout << ((mn == -1) ? -1 : mn);
return 0;
}