Pagini recente » Cod sursa (job #2214342) | Cod sursa (job #1578477) | Cod sursa (job #707552) | Cod sursa (job #724960) | Cod sursa (job #3142949)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("lapte.in");
ofstream fout("lapte.out");
int n, l;
struct tripl {
int a, b, i;
bool operator <(const tripl &oth) {
return this->a * oth.b > oth.a * this->b;
}
};
tripl v[102];
tripl ans[102], tmp[102];
inline bool ver(int t) {
int l1 = l, l2 = l;
for(int i = 1;i <= n;i++) {
int cant2 = min(t / v[i].b, l2);
int cant1 = (t - cant2 * v[i].b) / v[i].a;
tmp[v[i].i] = {cant1, cant2, v[i].i};
l1 -= cant1;
l2 -= cant2;
}
if(l1 <= 0 && l2 <= 0) {
for(int i = 1;i <= n;i++) {
ans[i] = tmp[i];
}
return 1;
}
return 0;
}
int main() {
fin >> n >> l;
for(int i = 1;i <= n;i++)
fin >> v[i].a >> v[i].b, v[i].i = i;
sort(v + 1, v + n + 1);
int st = 1, dr = 100;
while(st < dr) {
int mid = (st + dr) / 2;
if(ver(mid)) {
dr = mid;
}
else
st = mid + 1;
}
int t = dr;
fout << t << "\n";
for(int i = 1;i <= n;i++)
fout << ans[i].a << " " << ans[i].b << "\n";
return 0;
}