Pagini recente » Cod sursa (job #2656030) | Cod sursa (job #950103) | Cod sursa (job #558237) | Cod sursa (job #2239387) | Cod sursa (job #3218225)
#include <fstream>
#define INF 0x3f3f3f3f
using namespace std;
ifstream fin("lapte.in");
ofstream fout("lapte.out");
struct lapte {
int x, y;
} v[105], rez[105][105];
int n, l, dp[105][105];
bool valid(int xx) {
for(int i = 0; i <= n; i++) {
for(int j = 0; j <= l; j++) {
dp[i][j] = -INF;
}
}
dp[0][0] = 0;
for(int i = 1; i <= n; i++) {
for(int j = 0; j <= l; j++) {
for(int k = 0; k <= j && v[i].x * k <= xx; k++) {
int t = xx - (v[i].x * k);
int adaos = t / v[i].y;
if(dp[i][j] < dp[i - 1][j - k] + adaos) {
dp[i][j] = dp[i - 1][j - k] + adaos;
rez[i][j] = {k, adaos};
}
}
}
}
return dp[n][l] >= l;
}
void afisare(int a, int b) {
if(a == 1) {
fout << rez[a][b].x << " " << rez[a][b].y << "\n";
return;
}
afisare(a - 1, b - rez[a][b].x);
fout << rez[a][b].x << " " << rez[a][b].y << "\n";
}
int main() {
fin >> n >> l;
for(int i = 1; i <= n; i++) {
fin >> v[i].x >> v[i].y;
}
int st = 1, dr = 100 * 100, ans = 100 * 100 + 1;
while(st <= dr) {
int mid = (st + dr) / 2;
if(valid(mid)) {
ans = mid;
dr = mid - 1;
} else {
st = mid + 1;
}
}
fout << ans << "\n";
valid(ans);
afisare(n, l);
return 0;
}