Pagini recente » Cod sursa (job #2706402) | Cod sursa (job #2643097) | Cod sursa (job #1468904) | Cod sursa (job #542704) | Cod sursa (job #2507453)
#include <bits/stdc++.h>
using namespace std;
ifstream fin (".in");
ofstream fout (".out");
int v[10002];
int e[1002][2];
int main () {
int g, w;
cin >> g >> w;
int maxCost = 0;
for (int i = 1; i <= g; i++) {
cin >> e[i][0] >> e[i][1];
if (e[i][1] > maxCost)
maxCost = e[i][1];
}
cout << maxCost;
for (int i = 1; i <= g; i++) {
for (int j = maxCost; j >= w; j--)
v[j] = max(e[i][0], v[j - e[i][1]] + e[i][0]);
}
for (int i = 1; i <= 10002; i++) {
if (v[i] >= w) {
fout << i;
break;
}
}
}