Pagini recente » Cod sursa (job #2194946) | Cod sursa (job #1900103) | Cod sursa (job #134042) | Cod sursa (job #1179087) | Cod sursa (job #2479989)
#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 + 5], cost[N / 5 + 5], d[N * 2 - 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) {
for(int j = 0; j <= 10000; ++j) {
d[i][j] = d[i - 1][j];
if(j >= cost[i]) d[i][j] = max(d[i][j], d[i - 1][j - cost[i]] + power[i]);
}
}
for(int i = 0; i <= 10000; ++i) {
if(d[n][i] >= m) {
fout << i << "\n";
return 0;
}
}
fout << "-1";
return 0;
}